Submission #1194571


Source Code Expand

#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
int main()
{
    int n;
    cin >> n;
    lli a[300005];
    rep(i, 3 * n) cin >> a[i];
    sort(a, a + 3 * n);
    //小さいn人を犠牲にする
    //残り2*nで小さい方の和を最大化する
    lli ans = 0;
    rep(i, n)
    {
        ans += a[3 * n - 2 * i - 2];
        //        cout << a[3 * n - 2 * i - 2] << endl;
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task A - AtCoder Group Contest
User uenoku
Language C++14 (GCC 5.4.1)
Score 300
Code Size 686 Byte
Status AC
Exec Time 131 ms
Memory 2560 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 12
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 51 ms 2560 KB
08.txt AC 102 ms 2560 KB
09.txt AC 102 ms 2560 KB
10.txt AC 101 ms 2560 KB