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 "tickets.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
//#define int long long
long long find_maximum(int k, vector<vector<int>> x) {
int n=x.size(),m=x[0].size();
if(m==1){
vector<vector<int>> ans(n,vector<int>(m,0));
allocate_tickets(ans);
int sum=0;
for(int i=0;i<n;i++) sum+=x[i][0];
vector<int> v;
for(int i=0;i<n;i++) v.push_back(x[i][0]);
sort(v.begin(),v.end());
sum=(v[n/2]);
int res=0;
for(int i=0;i<n;i++){
res+=abs(x[i][0]-sum);
}
return res;
}
return 1;
}
# | 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... |