Submission #1194682
Source Code Expand
#include<iostream> #include<cstdio> #include<cstring> #include<string> #include<algorithm> #include<bitset> #include<vector> #include<deque> #include<queue> #include<map> #include<set> #include<stack> #include<cmath> #include<iomanip> #include <functional> using namespace std; typedef long long ll; const int mod = 1000000007; const int INF = 1 << 28; const double EPS = 1e-10; //cout << fixed << std::setprecision(9) //memset(a, 0, sizeof(a)); //-------------------------- vector<int> a; int n; int main() { cin >> n; for (int i = 0;i < 3*n;i++) { int t; cin >> t; a.push_back(t); } ll ans = 0; sort(a.begin(), a.end()); int k = 3 * n - 1; for (int i = 0;i < n;i++) { k--; ans += (ll)a[k]; k--; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | chuka231 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 814 Byte |
Status | AC |
Exec Time | 178 ms |
Memory | 2420 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 | 9 ms | 512 KB |
06.txt | AC | 178 ms | 2420 KB |
07.txt | AC | 58 ms | 2420 KB |
08.txt | AC | 128 ms | 2420 KB |
09.txt | AC | 126 ms | 2420 KB |
10.txt | AC | 127 ms | 2420 KB |