Submission #1191138

#TimeUsernameProblemLanguageResultExecution timeMemory
1191138anmattroiCarnival Tickets (IOI20_tickets)C++17
11 / 100
1 ms584 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(), m = x[0].size(); vector<vector<int> > ans(n, vector<int>(m, -1)); for (int i = 0; i < n; i++) ans[i][0] = 0; allocate_tickets(ans); int64_t sum = 0; vector<int> c; for (int i = 1; i <= n; i++) c.emplace_back(x[i-1][0]); sort(c.begin(), c.end()); for (int i = 0; i < n/2; i++) sum -= c[i]; for (int i = n/2; i < n; i++) sum += c[i]; 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...