Submission #1071342

#TimeUsernameProblemLanguageResultExecution timeMemory
1071342IgnutCarnival Tickets (IOI20_tickets)C++17
11 / 100
1 ms860 KiB
// Ignut #include <bits/stdc++.h> using namespace std; using ll = long long; void allocate_tickets(vector<vector<int>> s); ll find_maximum(int k, vector<vector<int>> x) { int n = x.size(), m = x.front().size(); vector<vector<int>> s; for (int i = 0; i < n; i ++) s.push_back({0}); allocate_tickets(s); vector<int> vals; for (int i = 0; i < n; i ++) for (int j = 0; j < m; j ++) vals.push_back(x[i][j]); sort(vals.begin(), vals.end()); ll res = 0; for (int i = 0; i < n; i ++) res += abs(vals[i] - vals[n / 2]); 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...