Submission #1194247


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef vector < int > VI;
typedef vector < VI > VVI;
typedef pair < int , int > PII;

#define ALL(x) x.begin(),x.end()
#define PB push_back
#define MP make_pair
#define SZ(x) x.size()
#define SET(a , b) memset(a , b , sizeof(a))
#define REP(i, n) for(int i = 0 ; i < n ; i++)
#define FOR(i, a, b) for(int i = a ; i <= b ; i++)
#define FORD(i, a, b) for(int i = a ; i >= b ; i--)
#define BOOST ios_base::sync_with_stdio(0);

const int N = 3e5 + 5;
int n;
int arr[N];
LL ans;
int main(){
	BOOST;
	cin >> n;
	FOR(i , 1 , 3 * n) cin >> arr[i];
	sort(arr + 1 , arr + 1 + 3 * n);
	REP(i , n){
		ans += (LL) (arr[3 * n - 1 - 2 * i]);
	}
	cout << ans << endl;
}

Submission Info

Submission Time
Task A - AtCoder Group Contest
User sharath_gauss
Language C++14 (GCC 5.4.1)
Score 300
Code Size 754 Byte
Status AC
Exec Time 47 ms
Memory 1408 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 4 ms 384 KB
06.txt AC 41 ms 1408 KB
07.txt AC 23 ms 1408 KB
08.txt AC 46 ms 1408 KB
09.txt AC 47 ms 1408 KB
10.txt AC 46 ms 1408 KB