Submission #1028939

#TimeUsernameProblemLanguageResultExecution timeMemory
1028939AmadooCarnival Tickets (IOI20_tickets)C++17
11 / 100
1 ms856 KiB
#include <bits/stdc++.h> #include "tickets.h" using namespace std; long long find_maximum(int k, std::vector<std::vector<int>> x) { int n = x.size(); int m = x[0].size(); long long sum1 = 0; vector <vector <int>> ans(n, vector <int>(m, 0)); sort(begin(x), end(x)); for(int i = 0; i < n / 2; ++i) sum1 += x[i][0]; long long sum2 = 0; for(int i = n / 2; i < n; ++i) sum2 += x[i][0]; cerr << sum1 << ' ' << sum2 << '\n'; allocate_tickets(ans); return sum2 - sum1; }
#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...