Submission #300886

#TimeUsernameProblemLanguageResultExecution timeMemory
300886luciocfCarnival Tickets (IOI20_tickets)C++14
11 / 100
2 ms768 KiB
#include <bits/stdc++.h> #include "tickets.h" using namespace std; typedef long long ll; const int maxn = 1510; int a[maxn]; ll find_maximum(int k, vector<vector<int>> x) { int n = x.size(); int m = x[0].size(); vector<vector<int>> S; for (int i = 0; i < n; i++) { vector<int> y; y.resize(m); y[0] = 0; S.push_back(y); } allocate_tickets(S); for (int i = 0; i < n; i++) a[i] = x[i][0]; sort(a, a+n); int med = a[n/2]; ll ans = 0; for (int i = 0; i <= n/2; i++) ans += 1ll*(med-a[i]); for (int i = n/2 + 1; i < n; i++) ans += 1ll*(a[i]-med); return ans; }
#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...