Submission #1369031
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair <int, int> pii; #define fr first #define sc second #define pb push_back #define mpr make_pair #define ppb pop_back() #define ins insert #define sz(s) int(s.size()) #define all(x) x.begin(), x.end() #define lb lower_bound #define ub upper_bound int n, a[1000000]; ll ans; int main() { ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for(int i = 1;i <= n * 3; ++ i){ cin >> a[i]; } sort(a + 1,a + 3 * n + 1); for(int i = 1; i <= 2 * n; ++ i){ if(i % 2 == 1)ans += a[i + n]; } cout << ans; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | Manas |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 648 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 |