Submission #1520865
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef unsigned long long ull; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; const ull mod = 1e9 + 7; #define REP(i,n) for(int i=0;i<(int)n;++i) int main(){ int N; cin >> N; vector<ll> a(3*N); REP(i, 3*N) cin >> a[i]; sort(a.rbegin(), a.rend()); ll res = 0; REP(i, 2*N) if(i%2==1) res += a[i]; cout << res << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | theory_and_me |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 496 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 | 108 ms | 2560 KB |
09.txt | AC | 103 ms | 2560 KB |
10.txt | AC | 103 ms | 2560 KB |