Submission #1194206
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define ll long long const int N = 1e5 + 5, MOD = 1e9 + 7; int A[N]; int main(){ int n, cntr = 0; ll ans = 0; cin>>n; for(int i = 0; i < 3*n; i++) cin>>A[i]; sort(A, A + 3*n); for(int i = 3*n - 2; ; i -= 2){ ans += A[i]; cntr++; if(cntr == n) break; } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | sidhant |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 353 Byte |
Status | RE |
Exec Time | 311 ms |
Memory | 764 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 6 ms | 764 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 | 256 KB |
06.txt | RE | 311 ms | 640 KB |
07.txt | RE | 113 ms | 640 KB |
08.txt | RE | 131 ms | 640 KB |
09.txt | RE | 132 ms | 640 KB |
10.txt | RE | 132 ms | 640 KB |