Submission #430779

#TimeUsernameProblemLanguageResultExecution timeMemory
430779juggernautCarnival Tickets (IOI20_tickets)C++17
11 / 100
2 ms588 KiB
#include"tickets.h" #include<bits/stdc++.h> using namespace std; #ifndef EVAL #include"grader.cpp" #endif typedef long long ll; 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,-1)); vector<int>vec; ll sum=0; for(int i=0;i<n;i++){ answer[i][m-1]=0; vec.push_back(x[i][m-1]); sum-=vec.back(); } sort(vec.begin(),vec.end()); for(int i=n-1;i>=n/2;i--)sum+=vec[i]*2; allocate_tickets(answer); 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...