Submission #1194581
Source Code Expand
#include <iostream> #include <iomanip> // << fixed << setprecision(xxx) #include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ; #include <vector> #include <string> // to_string(nnn) // substr(m, n) // stoi(nnn) #include <complex> #include <tuple> // get<n>(xxx) #include <queue> #include <stack> #include <map> // if (M.find(key) != M.end()) { } #include <set> // S.insert(M); // if (S.find(key) != S.end()) { } // for (auto it=S.begin(); it != S.end(); it++) { } // auto it = S.lower_bound(M); #include <random> // random_device rd; mt19937 mt(rd()); #include <cctype> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> // atoi(xxx) using namespace std; #define DEBUG 0 // change 0 -> 1 if we need debug. // insert #if<tab> by my emacs. #if DEBUG == 1 ... #end typedef long long ll; // const int dx[4] = {1, 0, -1, 0}; // const int dy[4] = {0, 1, 0, -1}; // const int C = 1e6+10; // const ll M = 1000000007; int N; ll a[300010]; int main () { cin >> N; N = 3 * N; for (auto i = 0; i < N; ++i) { cin >> a[i]; } sort(a, a+N); reverse(a, a+N); ll ans = 0; int M = N/3; int cnt = 0; for (auto i = 0; i < N; ++i) { if (i%2 == 1) { ans += a[i]; ++cnt; if (M == cnt) break; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | kazunetakahashi |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1347 Byte |
Status | AC |
Exec Time | 133 ms |
Memory | 2560 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt |
All | 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 7 ms | 384 KB |
06.txt | AC | 133 ms | 2560 KB |
07.txt | AC | 51 ms | 2560 KB |
08.txt | AC | 103 ms | 2560 KB |
09.txt | AC | 103 ms | 2560 KB |
10.txt | AC | 103 ms | 2560 KB |