Submission #1194196
Source Code Expand
#include <algorithm> #include <bitset> #include <complex> #include <cstdio> #include <cstdint> #include <cassert> #include <cmath> #include <deque> #include <functional> #include <iomanip> #include <iostream> #include <limits> #include <map> #include <numeric> #include <queue> #include <set> #include <sstream> #include <stack> #include <tuple> #include <utility> #include <vector> using namespace std; using int64 = int64_t; constexpr int64 MOD = 1000000007; int N; int64 arr[303030]; int main() { cin >> N; for (int j = 0; j < 3*N; ++j) { cin >> arr[j]; } sort(arr, arr+3*N); int64 ans = 0; for (int j = 0; j < N; ++j) { ans += arr[3*N-2-2*j]; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | lrmystp |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 783 Byte |
Status | AC |
Exec Time | 174 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 | 9 ms | 384 KB |
06.txt | AC | 174 ms | 2560 KB |
07.txt | AC | 59 ms | 2560 KB |
08.txt | AC | 126 ms | 2560 KB |
09.txt | AC | 127 ms | 2560 KB |
10.txt | AC | 125 ms | 2560 KB |