Submission #5035019
Source Code Expand
import java.io.PrintStream; import java.util.Scanner; import java.util.stream.IntStream; public class Main { static final Scanner sc = new Scanner(System.in); static final PrintStream so = System.out; public static void main(String[] args) { int N = ni(); int[] t = new int[4]; for (int i = 0; i < N; i++) { t[i] = ni(); } int sum = IntStream.of(t).sum(); int ans = Integer.MAX_VALUE; for (int i = 0; i < (1 << 4); i++) { int f = f(t, i); int time_i = Math.max(f, sum-f); ans = Math.min(time_i, ans); } so.println(ans); } private static int f(int[] t, int bits) { int sum = 0; for (int i = 0; i < t.length; i++ ) { if (((bits >> i) & 1) == 1) { sum += t[i]; } } return sum; } static int ni() { return sc.nextInt(); } static long nl() { return sc.nextLong(); } static String ns() { return sc.next(); } static char[] nsToChars() { return sc.next().toCharArray(); } static int[] nints(int n) { return nints(n, 0, 0); } static int[] nints(int n, int padHead, int padTail) { int[] a = new int[padHead + n + padTail]; for (int i = 0; i < n; i++) a[padHead + i] = ni(); return a; } }
Submission Info
Submission Time | |
---|---|
Task | A - 高橋君とお肉 |
User | central_field |
Language | Java8 (OpenJDK 1.8.0) |
Score | 100 |
Code Size | 1513 Byte |
Status | AC |
Exec Time | 190 ms |
Memory | 28500 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask0-sample-03.txt |
All | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask0-sample-03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample-01.txt | AC | 190 ms | 24788 KB |
subtask0-sample-02.txt | AC | 184 ms | 26704 KB |
subtask0-sample-03.txt | AC | 181 ms | 26708 KB |
subtask1-01.txt | AC | 166 ms | 26324 KB |
subtask1-02.txt | AC | 168 ms | 25172 KB |
subtask1-03.txt | AC | 168 ms | 26580 KB |
subtask1-04.txt | AC | 170 ms | 26188 KB |
subtask1-05.txt | AC | 174 ms | 24784 KB |
subtask1-06.txt | AC | 175 ms | 26832 KB |
subtask1-07.txt | AC | 169 ms | 24144 KB |
subtask1-08.txt | AC | 175 ms | 24788 KB |
subtask1-09.txt | AC | 167 ms | 28500 KB |
subtask1-10.txt | AC | 179 ms | 24660 KB |
subtask1-11.txt | AC | 167 ms | 24532 KB |
subtask1-12.txt | AC | 173 ms | 25428 KB |
subtask1-13.txt | AC | 167 ms | 25044 KB |
subtask1-14.txt | AC | 169 ms | 24532 KB |
subtask1-15.txt | AC | 181 ms | 26964 KB |
subtask1-16.txt | AC | 180 ms | 26964 KB |