| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 301131 | akh | 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.
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;
}
}