Submission #430774

#TimeUsernameProblemLanguageResultExecution timeMemory
430774juggernautCarnival Tickets (IOI20_tickets)C++17
0 / 100
1 ms256 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...