This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
//void allocate_tickets(vector<vector<int>>);
long long find_maximum(int k, vector<vector<int> > x) {
int N = x.size();
int M = x[0].size();
vector<vector<int> > ans;
ans.resize(N);
int i;
for(i=0;i<N;i++) ans[i].resize(M);
for(i=0;i<N;i++) ans[i][0] = 0;
long long int cnt = 0;
vector<int> V;
for(i=0;i<N;i++) V.push_back(x[i][0]);
sort(V.begin(),V.end());
for(i=0;i<N;i++) {
if(i<N/2) cnt -= V[i];
else cnt += V[i];
}
allocate_tickets(ans);
return cnt;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |