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>
using namespace std;
#ifndef EVAL
#include"grader.cpp"
#endif
typedef long long ll;
bool cmp(vector<int>l,vector<int>r){
return l[0]<r[0];
}
ll find_maximum(int k,vector<vector<int>>x){
int n=x.size();
int m=x[0].size();
vector<vector<int>>answer;
answer.assign(n,vector<int>(m,0));
ll sum=0;
sort(x.begin(),x.end(),cmp);
allocate_tickets(answer);
sum=1ll*n*1ll*x[n/2-1][0];
for(int i=0;i<n/2;i++)sum-=x[i][0];
return sum;
}
# | 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... |