Submission #837749

#TimeUsernameProblemLanguageResultExecution timeMemory
837749KerimCarnival Tickets (IOI20_tickets)C++17
11 / 100
1 ms724 KiB
#include "tickets.h" #include <bits/stdc++.h> #define ll long long 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)); ll answer = 0; if (m == 1){ vector<int> v; for (int i = 0; i < n; i++) v.push_back(x[i][0]), ans[i][0] = 0; sort(v.begin(), v.end()); for (int i = 0; i < n/2; i++) answer -= v[i]; for (int i = n/2; i < n; i++) answer += v[i]; } allocate_tickets(ans); return answer; }
#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...