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