Submission #955028

#TimeUsernameProblemLanguageResultExecution timeMemory
955028Trisanu_DasCarnival Tickets (IOI20_tickets)C++17
11 / 100
1 ms604 KiB
#include "tickets.h" #include <bits/stdc++.h> using namespace std; long long find_maximum(int k, vector<vector<int> > x) { sort(x.begin(), x.end()); int n = x.size(); vector<vector<int> > ans(n, vector<int>(1)); allocate_tickets(ans); long long res = 0; for(auto u : x) res += abs(u.back() - x[n / 2].back()); return res; }
#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...