Submission #1194193
Source Code Expand
#include <bits/stdc++.h> #define x first #define y second using namespace std; typedef long long ll; typedef long double ld; typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<int,int> ii; typedef pair<ll,ll> pll; const int mod=1000000000+7; int addm(int& a,int b) {return (a+=b)<mod?a:a-=mod;} template<class T,class U> bool smin(T& a,U b) {return a>b?(a=b,1):0;} template<class T,class U> bool smax(T& a,U b) {return a<b?(a=b,1):0;} int N,a[300000]; ll sum; int main() { ios::sync_with_stdio(0); cin.tie(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,j=0;j<i;i-=2,j++) sum+=a[i]; cout << sum << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | Whalanator |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 699 Byte |
Status | AC |
Exec Time | 46 ms |
Memory | 1408 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 | 4 ms | 384 KB |
06.txt | AC | 36 ms | 1408 KB |
07.txt | AC | 22 ms | 1408 KB |
08.txt | AC | 46 ms | 1408 KB |
09.txt | AC | 46 ms | 1408 KB |
10.txt | AC | 45 ms | 1408 KB |