Submission #1478683
Source Code Expand
import java.util.*; public class Main { public static void main(String[] args){ Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int[] a = new int[3*N]; for(int i = 0; i < 3*N; i++) a[i] = sc.nextInt(); quickSort(a, 0, a[3*N-1]); long sum = 0; for(int i = 0; i < N; i++){ sum += a[3*N-1-(2*i+1)]; } System.out.println(sum); } static void swap(int[] a, int idx1, int idx2){ int tmp = a[idx1]; a[idx1] = a[idx2]; a[idx2] = tmp; } static void quickSort(int[] a, int left, int right){ int pl = left; int pr = right; int x = a[(pl+pr)/2]; do { while(a[pl] < x) pl++; while(a[pr] > x) pr--; if (pl <= pr) swap(a, pl++, pr--); } while (pl <= pr); if (left < pr) quickSort(a, left, pr); if (pl < right) quickSort(a, pl, right); } }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | vistlip1060 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 958 Byte |
Status | RE |
Exec Time | 633 ms |
Memory | 91912 KB |
Judge Result
Set Name | Sample | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 101 ms | 19924 KB |
00_example_02.txt | RE | 100 ms | 21712 KB |
01.txt | RE | 92 ms | 21204 KB |
02.txt | RE | 96 ms | 18772 KB |
03.txt | WA | 102 ms | 19028 KB |
04.txt | RE | 93 ms | 21844 KB |
05.txt | RE | 244 ms | 42388 KB |
06.txt | RE | 633 ms | 90384 KB |
07.txt | AC | 566 ms | 88452 KB |
08.txt | RE | 586 ms | 91824 KB |
09.txt | WA | 610 ms | 91340 KB |
10.txt | WA | 581 ms | 91912 KB |