Submission #1194265
Source Code Expand
#include <iostream> #include <fstream> #include <vector> #include <string> #include <set> #include <list> #include <fstream> #include <limits> #include <map> #include <algorithm> #include <cmath> using namespace std; #define ll long long #define mod 1000000007 #define infinity (ll)1e18+1 #define pdd pair<double,double> #define pll pair<ll, ll> #define MP make_pair #define vi vector<ll> #define FOR(i,a,b) for(int i = (a); i < (b); ++i) #define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); --i) #define REPEAT(i) FOR(counter1234,0,i) #define ALL(a) a.begin(), a.end() ll gcd(ll a, ll b) { if (a%b == 0) return b; if (a < b) swap(a, b); return gcd(a%b, b); } int f(int a, int b) { return a > b; } int main() { int n; cin >> n; vi a(3 * n); FOR(i, 0, 3 * n) cin >> a[i]; sort(ALL(a), f); ll b1 = 0; FOR(i, 0, n) b1 += a[2 * i + 1]; cout << b1; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | BohdanPastuschak |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 936 Byte |
Status | AC |
Exec Time | 138 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 | 8 ms | 384 KB |
06.txt | AC | 138 ms | 2560 KB |
07.txt | AC | 57 ms | 2560 KB |
08.txt | AC | 108 ms | 2560 KB |
09.txt | AC | 108 ms | 2560 KB |
10.txt | AC | 108 ms | 2560 KB |