Submission #2380962


Source Code Expand

import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		Integer[] a = new Integer[3 * n];
		for(int i = 0 ; i < 3 * n ; i++) a[i] = sc.nextInt();
		Arrays.sort(a, Comparator.reverseOrder());
		long ans = 0;
		for(int i = 0 ; i < n ; i++) {
			ans += a[2 * i + 1];
		}
		System.out.println(ans);
	}
}

Submission Info

Submission Time
Task A - AtCoder Group Contest
User kouta1612
Language Java8 (OpenJDK 1.8.0)
Score 300
Code Size 470 Byte
Status AC
Exec Time 853 ms
Memory 100376 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 95 ms 19028 KB
00_example_02.txt AC 96 ms 19284 KB
01.txt AC 92 ms 19028 KB
02.txt AC 108 ms 21972 KB
03.txt AC 97 ms 21460 KB
04.txt AC 94 ms 21716 KB
05.txt AC 269 ms 40208 KB
06.txt AC 699 ms 100376 KB
07.txt AC 595 ms 89872 KB
08.txt AC 835 ms 92544 KB
09.txt AC 853 ms 98516 KB
10.txt AC 849 ms 93228 KB