Submission #1194261
Source Code Expand
#include<cstdio> #include<cstdlib> #include<cmath> #include<iostream> #include<string> #include<stack> #include<queue> #include<vector> #include<map> #include<set> #include<algorithm> #define rep(n) for(int i=0;i<n;i++) #define repp(j, n) for(int j=0;j<n;j++) #define reppp(i, m, n) for(int i=m;i<=n;i++) #define all(c) c.begin(), c.end() #define rall(c) c.rbegin(), c.rend() #define MOD 1000000007 #define MAX 1000000001 #define INF 1410065408 #define EPS 1e-9 using namespace std; typedef long long ll; typedef pair<ll, ll> P; struct edge{int from, to; ll cost;}; signed main(){ ll N; cin >> N; vector<ll> a(3*N); rep(3*N) cin >> a[i]; sort(all(a)); ll ans = 0; reppp(i, N, 2*N-1){ ans += a[i]; } cout << ans; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | Noimin |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 768 Byte |
Status | WA |
Exec Time | 132 ms |
Memory | 2560 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 | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
01.txt | WA | 1 ms | 256 KB |
02.txt | WA | 1 ms | 256 KB |
03.txt | WA | 1 ms | 256 KB |
04.txt | WA | 1 ms | 256 KB |
05.txt | WA | 7 ms | 384 KB |
06.txt | AC | 132 ms | 2560 KB |
07.txt | AC | 51 ms | 2560 KB |
08.txt | WA | 103 ms | 2560 KB |
09.txt | WA | 103 ms | 2560 KB |
10.txt | WA | 103 ms | 2560 KB |