Submission #3262865
Source Code Expand
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using vi = vector<int>; using vll = vector<ll>; using vpii = vector<pii>; using vpll = vector<pll>; using vs = vector<string>; template <typename T> using ost = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; #define forn(i,n) for(int i=0; i<int(n); ++i) #define all(x) (x).begin(), (x).end() #define pb push_back #define ff first #define ss second int main() { ios::sync_with_stdio(false); int n; cin >> n; n *= 3; vi xs(n); for (int& x:xs) cin>>x; sort(all(xs)); ll ans=0; for (int i=0, j=n-2; i<j; i++, j-=2) ans += xs[j]; cout << ans << '\n'; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | traxex |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 856 Byte |
Status | AC |
Exec Time | 47 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 | 38 ms | 1408 KB |
07.txt | AC | 23 ms | 1408 KB |
08.txt | AC | 47 ms | 1408 KB |
09.txt | AC | 47 ms | 1408 KB |
10.txt | AC | 46 ms | 1408 KB |