제출 #1050303

#제출 시각아이디문제언어결과실행 시간메모리
1050303TahirAliyev카니발 티켓 (IOI20_tickets)C++17
11 / 100
1 ms604 KiB
#include "tickets.h" #include <bits/stdc++.h> using namespace std; #define pii pair<int, int> #define ll long long ll find_maximum(int k, std::vector<std::vector<int>> x) { int n = x.size(); int m = x[0].size(); vector<pii> v; for(int i = 0; i < n; i++){ v.push_back({x[i][0], i}); } vector<vector<int>> res; res.resize(n); for(int i = 0; i < n; i++) res[i].resize(m); sort(v.begin(), v.end()); ll ans = 0; for(pii a : v){ res[a.second][0] = 0; ans += abs(a.first - v[(n - 1) / 2].first); } allocate_tickets(res); 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...