Submission #1680375
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define REP(i,n) FOR(i,0,n) #define FOR(i,a,b) for(ll i=a;i<b;i++) #define PB push_back #define LB lower_bound #define UB upper_bound #define PQ priority_queue #define UM unordered_map #define ALL(a) (a).begin(),(a).end() typedef vector<ll> vi; typedef vector<vector<ll>> vvi; const ll INF = (1ll << 60); typedef pair<ll,ll> pii; struct Edge{ll s,t,d; Edge(ll s,ll t,ll d):s(s),t(t),d(d){}}; typedef vector<vector<Edge>> Graph; typedef vector<pii> vpii; int main() { ll N; cin>>N; vi a(3*N); REP(i,3*N) cin>>a[i]; sort(ALL(a)); ll sum=0; REP(i,N) sum+=a[3*N-2-2*i]; cout<<sum<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | kkty |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 690 Byte |
Status | AC |
Exec Time | 132 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 | 132 ms | 2560 KB |
07.txt | AC | 51 ms | 2560 KB |
08.txt | AC | 104 ms | 2560 KB |
09.txt | AC | 104 ms | 2560 KB |
10.txt | AC | 102 ms | 2560 KB |