# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
302602 | ASD3D | Carnival Tickets (IOI20_tickets) | Java | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
public static int find_maximum(int k, int[][] x) {
int ans = 0;
for (int i = 0; i < x.length; i++) {
ans += x[i][0];
}
ans -= x.length * x[x.length/2][0];
int[][] s = new int[x.length][1];
allocate_tickets(s);
return ans;
}