Submission #1194020
Source Code Expand
#include <stdio.h> #include <algorithm> #include <vector> #include <stack> #include <queue> #include <set> #include <map> using namespace std; typedef long long ll; typedef pair<int, int> pi; const int MAX_N = 1e5 + 300; int N, Nr[MAX_N * 3]; ll Ans = 0; int main() { scanf("%d", &N); for(int i=0; i<3*N; i++) scanf("%d", &Nr[i]); sort(Nr, Nr+3*N); for(int i=N; i<3*N; i+=2) Ans += 1ll * Nr[i]; printf("%lld\n", Ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | KJBS2 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 463 Byte |
Status | AC |
Exec Time | 48 ms |
Memory | 1280 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:20:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); for(int i=0; i<3*N; i++) scanf("%d", &Nr[i]); ^ ./Main.cpp:20:63: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); for(int i=0; i<3*N; i++) scanf("%d", &Nr[i]); ^
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 | 128 KB |
00_example_02.txt | AC | 1 ms | 128 KB |
01.txt | AC | 1 ms | 128 KB |
02.txt | AC | 1 ms | 128 KB |
03.txt | AC | 1 ms | 128 KB |
04.txt | AC | 1 ms | 128 KB |
05.txt | AC | 3 ms | 256 KB |
06.txt | AC | 40 ms | 1280 KB |
07.txt | AC | 26 ms | 1280 KB |
08.txt | AC | 48 ms | 1280 KB |
09.txt | AC | 48 ms | 1280 KB |
10.txt | AC | 48 ms | 1280 KB |