Submission #1194192
Source Code Expand
/* Hanit Banga */ #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <cstdio> #include <vector> #include <map> #include <set> using namespace std; #define pb push_back #define fast_cin() ios_base::sync_with_stdio(false) typedef long long ll; typedef pair <int, int> pii; typedef pair <ll, ll> pll; const int N = 3e5 + 5; ll a[N]; int main() { int n; cin >> n; for (int i = 0; i < 3*n; ++i) cin >> a[i]; sort(a, a + 3*n); int ctr = 0; ll ans = 0; for (int i = 3*n - 2; ctr < n; i -= 2, ++ctr) ans += a[i]; cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | Cerberus97 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 625 Byte |
Status | AC |
Exec Time | 131 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 | 131 ms | 2560 KB |
07.txt | AC | 50 ms | 2560 KB |
08.txt | AC | 102 ms | 2560 KB |
09.txt | AC | 102 ms | 2560 KB |
10.txt | AC | 101 ms | 2560 KB |