Submission #1291676

#TimeUsernameProblemLanguageResultExecution timeMemory
1291676kahoulCarnival Tickets (IOI20_tickets)C++20
11 / 100
2 ms580 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>> answer; for (int i = 0; i < n; i++) { vector<int> row(m); for (int j = 0; j < m; j++) { row[j] = 0; } answer.push_back(row); } allocate_tickets(answer); long long ans = 0; vector<int> vec; for (int i = 0; i < n; i++) { vec.push_back(x[i][0]); } sort(vec.begin(), vec.end()); for (int i = 0; i < n; i++) { ans += abs(vec[vec.size() / 2] - vec[i]); } 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...