Submission #395508

#TimeUsernameProblemLanguageResultExecution timeMemory
395508snasibov05카니발 티켓 (IOI20_tickets)C++14
0 / 100
1 ms204 KiB
#include "tickets.h" #include <bits/stdc++.h> #include <vector> using namespace std; long long find_maximum(int k, vector<std::vector<int>> x) { int n = x.size(); int m = x[0].size(); vector<vector<int>> ans(n, vector<int>(m)); for (int i = 0; i < n; ++i) { ans[i][0] = 0; } vector<int> v(n); for (int i = 0; i < n; ++i) { v[i] = x[i][0]; } int res = 0; sort(v.begin(), v.end()); for (int i = 0; i < n; ++i) { if (i < n / 2) res -= v[i]; else res += v[i]; } allocate_tickets(ans); 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...