Submission #390527

#TimeUsernameProblemLanguageResultExecution timeMemory
390527AlexPop28Carnival Tickets (IOI20_tickets)C++14
11 / 100
2 ms716 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>> ans(n, vector<int>(m, -1)); vector<int> v(n); for (int i = 0; i < n; ++i) { v[i] = x[i][0]; } nth_element(v.begin(), v.begin() + n / 2, v.end()); int med = v[n / 2]; long long res = 0; for (int i = 0; i < n; ++i) { if (v[i] < med) res -= v[i]; else res += v[i]; ans[i][0] = 0; } allocate_tickets(ans); 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...