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;
vector<vector<int>>x;
int n,m;
bool cmp(int l,int r){
if(x[l][m-1]==x[r][m-1])return x[l][0]<x[r][0];
return x[l][m-1]>x[r][m-1];
}
ll find_maximum(int k,vector<vector<int>>X){
::x=X;
n=x.size();
m=x[0].size();
vector<vector<int>>answer;
answer.assign(n,vector<int>(m,-1));
vector<int>vec(n);
iota(vec.begin(),vec.end(),0);
ll sum=0;
sort(vec.begin(),vec.end(),cmp);
for(int i=0;i<n/2;i++){
sum+=x[vec[i]][m-1];;
answer[vec[i]][m-1]=0;
}
for(int i=0;i<n;i++)if(answer[i][m-1]!=0)answer[i][0]=0,sum-=x[i][0];
allocate_tickets(answer);
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... |