Submission #1297762

#TimeUsernameProblemLanguageResultExecution timeMemory
1297762kawhietCarnival Tickets (IOI20_tickets)C++20
11 / 100
2 ms580 KiB
#include <bits/stdc++.h> #include "tickets.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)); allocate_tickets(ans); long long res = 0; vector<int> a; for (int i = 0; i < n; i++) { a.push_back(x[i][0]); } sort(a.begin(), a.end()); for (int i = 0; i < n; i++) { res += abs(a[i] - a[i / 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...