Submission #301133

#TimeUsernameProblemLanguageResultExecution timeMemory
301133akhCarnival Tickets (IOI20_tickets)Java
0 / 100
92 ms10240 KiB
import java.util.Arrays; import java.util.Collection; import java.util.Collections; public class tickets { long find_maximum(int k, int[][] x) { int n = x.length; int m = x[0].length; int[][] answer = new int[n][m]; Arrays.sort(x[0]); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { answer[i][j] = 0; } } grader.allocate_tickets(answer); long sum = 0 ; for(int i=0 ; i< n ; i++) if (i<n/2) sum -= x[0][i] ; else sum += x[0][i] ; return sum; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...