Submission #5809606
Source Code Expand
import java.io.*; import java.util.*; import java.util.Map.Entry; import java.util.stream.Collectors; @SuppressWarnings("unused") public class Main { String fileName = "input.txt"; final boolean isDebug = false; //final boolean isDebug = true; FastScanner in = new FastScanner(System.in); PrintWriter out = new PrintWriter(System.out); final int MOD = (int)1e9+7; final long INF = Long.MAX_VALUE / 2; //final int INF = Integer.MAX_VALUE / 2; void solve() throws Exception{ int N = in.nextInt(); int[] A = new int[N]; for(int i = 0; i < N; i++) A[i] = in.nextInt(); Arrays.sort(A); long sum = 0; for(int i = N-1; i >= 0; i -= 2) sum += A[i]; System.out.println(sum); } /* end solve */ /* main */ public static void main(String[] args) throws Exception { new Main().m(); } void m() throws Exception { if(isDebug) in = new FastScanner(new FileInputStream(fileName)); solve(); out.flush(); } /* end main */ } /* end Main */ class FastScanner { Reader input; FastScanner() {this(System.in);} FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));} int nextInt() {return (int) nextLong();} long nextLong() { try { int sign = 1; int b = input.read(); while ((b < '0' || '9' < b) && b != '-' && b != '+') { b = input.read(); } if (b == '-') { sign = -1; b = input.read(); } else if (b == '+') { b = input.read(); } long ret = b - '0'; while (true) { b = input.read(); if (b < '0' || '9' < b) return ret * sign; ret *= 10; ret += b - '0'; } } catch (IOException e) { e.printStackTrace(); return -1; } } double nextDouble() { try { double sign = 1; int b = input.read(); while ((b < '0' || '9' < b) && b != '-' && b != '+') { b = input.read(); } if (b == '-') { sign = -1; b = input.read(); } else if (b == '+') { b = input.read(); } double ret = b - '0'; while (true) { b = input.read(); if (b < '0' || '9' < b) break; ret *= 10; ret += b - '0'; } if (b != '.') return sign * ret; double div = 1; b = input.read(); while ('0' <= b && b <= '9') { ret *= 10; ret += b - '0'; div *= 10; b = input.read(); } return sign * ret / div; } catch (IOException e) { e.printStackTrace(); return Double.NaN; } } char nextChar() { try { int b = input.read(); while (Character.isWhitespace(b)) { b = input.read(); } return (char) b; } catch (IOException e) { e.printStackTrace(); return 0; } } String nextStr() { try { StringBuilder sb = new StringBuilder(); int b = input.read(); while (Character.isWhitespace(b)) { b = input.read(); } while (b != -1 && !Character.isWhitespace(b)) { sb.append((char) b); b = input.read(); } return sb.toString(); } catch (IOException e) { e.printStackTrace(); return ""; } } }
Submission Info
Submission Time | |
---|---|
Task | A - カードと兄妹 |
User | Oland |
Language | Java8 (OpenJDK 1.8.0) |
Score | 100 |
Code Size | 3093 Byte |
Status | AC |
Exec Time | 73 ms |
Memory | 22484 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt |
All | 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, sample-01.txt, sample-02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 71 ms | 21204 KB |
01-02.txt | AC | 70 ms | 18388 KB |
01-03.txt | AC | 69 ms | 20948 KB |
01-04.txt | AC | 72 ms | 22484 KB |
01-05.txt | AC | 69 ms | 17488 KB |
01-06.txt | AC | 71 ms | 19924 KB |
01-07.txt | AC | 72 ms | 21204 KB |
01-08.txt | AC | 71 ms | 18132 KB |
01-09.txt | AC | 73 ms | 20692 KB |
01-10.txt | AC | 70 ms | 20692 KB |
01-11.txt | AC | 72 ms | 19156 KB |
sample-01.txt | AC | 71 ms | 20564 KB |
sample-02.txt | AC | 70 ms | 20948 KB |