Submission #1194626
Source Code Expand
#include<iostream> #include<algorithm> #include<cstdio> #include<cmath> #include<math.h> #include<string> #include<string.h> #include<stack> #include<queue> #include<vector> #include<utility> #include<set> #include<map> #include<stdlib.h> #include<iomanip> using namespace std; #define ll long long #define ld long double #define EPS 0.0000000001 #define INF 1e9 #define MOD 1000000007 #define rep(i,n) for(i=0;i<n;i++) #define loop(i,a,n) for(i=a;i<n;i++) #define all(in) in.begin(),in.end() #define shosu(x) fixed<<setprecision(x) typedef vector<int> vi; typedef pair<int,int> pii; int main(void) { int i,j; int n; cin>>n; vi a(3*n); rep(i,3*n)cin>>a[i]; sort(all(a)); rep(i,n) a.erase(a.begin()); ll ans=0; for(i=0;i<2*n;i++)if(i%2==0)ans+=a[i]; cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | rika0384 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 840 Byte |
Status | TLE |
Exec Time | 2103 ms |
Memory | 1408 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 | 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 | 21 ms | 256 KB |
06.txt | TLE | 2103 ms | 1408 KB |
07.txt | TLE | 2103 ms | 1408 KB |
08.txt | TLE | 2103 ms | 1408 KB |
09.txt | TLE | 2103 ms | 1408 KB |
10.txt | TLE | 2103 ms | 1408 KB |