Submission #5570979


Source Code Expand

Copy
#include<bits/stdc++.h>
using namespace std;
#define lint long long
#define ll long long
#define pq priority_queue
#define mp make_pair
#define vl vector<long long>
long long INF = 1e10;
#define pii pair<long long,long long>
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
/******************************define**********************************/

/*****************************functions********************************/

/****************************main function*****************************/
int main(void){
    int n; cin >> n;
    vector<int> s(3*n);
    for(int i = 0;i < 3*n;i++) cin >> s[i];
    sort(all(s));reverse(all(s));
    ll ans = 0;
    for(int i = 1;i <= 2*n - 1;i += 2) ans += s[i];
    cout << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task A - AtCoder Group Contest
User lynmisakura
Language C++14 (GCC 5.4.1)
Score 300
Code Size 778 Byte
Status
Exec Time 141 ms
Memory 1408 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 00_example_01.txt, 00_example_02.txt
All 300 / 300 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 1 ms 256 KB
00_example_02.txt 1 ms 256 KB
01.txt 1 ms 256 KB
02.txt 1 ms 256 KB
03.txt 1 ms 256 KB
04.txt 1 ms 256 KB
05.txt 7 ms 256 KB
06.txt 141 ms 1408 KB
07.txt 52 ms 1408 KB
08.txt 103 ms 1408 KB
09.txt 102 ms 1408 KB
10.txt 102 ms 1408 KB