Submission #588569

#TimeUsernameProblemLanguageResultExecution timeMemory
588569LIFCarnival Tickets (IOI20_tickets)C++14
0 / 100
1 ms340 KiB
#include "tickets.h" #include <vector> #include<bits/stdc++.h> using namespace std; bool cmp(int x,int y) { return x<y; } long long find_maximum(int k, std::vector<std::vector<int> > x) { int mm = x[0].size(); //find the m; int n = x.size(); vector< vector<int> > s; int sum =0; if(mm==1) { for(int i=0;i<n;i++) { vector<int> q; q.push_back(1); s.push_back(q); } int a[20005]; for(int i=0;i<n;i++) { a[i] = x[i][0]; } sort(a,a+n); int ans = a[n/2-1]+a[n/2]; ans /=2; for(int i=0;i<n;i++) { sum += abs(ans - a[i]); } } allocate_tickets(s); 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...