Submission #1812968
Source Code Expand
import java.io.*; import java.util.*; import java.math.*; import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; long MOD = 1_000_000_007; void solve() { int n = ni(); long[] a = new long[3*n]; for(int i = 0; i < 3*n; i++){ a[i] = nl(); } Arrays.sort(a); long ans = 0; for(int i = 0; i < n; i++){ ans += a[3*n-2-2*i]; } out.println(ans); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Main().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b) && b != ' ')){ sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } static class ArrayUtils { public static void fill(double[][] array, double value) { for (double[] a : array) Arrays.fill(a, value); } public static void fill(double[][][] array, double value) { for (double[][] l : array) fill(l, value); } } }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | yuya178 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 300 |
Code Size | 4029 Byte |
Status | AC |
Exec Time | 281 ms |
Memory | 25264 KB |
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 | 69 ms | 17748 KB |
00_example_02.txt | AC | 69 ms | 23124 KB |
01.txt | AC | 68 ms | 21204 KB |
02.txt | AC | 69 ms | 19156 KB |
03.txt | AC | 68 ms | 18388 KB |
04.txt | AC | 69 ms | 19796 KB |
05.txt | AC | 82 ms | 22228 KB |
06.txt | AC | 115 ms | 21716 KB |
07.txt | AC | 99 ms | 22996 KB |
08.txt | AC | 268 ms | 25264 KB |
09.txt | AC | 281 ms | 23428 KB |
10.txt | AC | 159 ms | 21464 KB |