Submission #308540

#TimeUsernameProblemLanguageResultExecution timeMemory
308540SundavarCarnival Tickets (IOI20_tickets)C++14
0 / 100
1 ms288 KiB
#include "tickets.h" #include <bits/stdc++.h> using namespace std; long long find_maximum(int k, vector<vector<int>> x) { int n = x.size(); int m = x[0].size(); vector<vector<int>> answer(n, vector<int> (m, 0)); int sol = 0; vector<int> a(n); for(int i = 0; i < n; i++) a[i] = x[i][0]; sort(a.begin(), a.end()); int b = a[n/2]; for(int& num : a) sol += abs(num - b); allocate_tickets(answer); return sol; }
#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...