제출 #300765

#제출 시각아이디문제언어결과실행 시간메모리
300765IgorI카니발 티켓 (IOI20_tickets)C++17
11 / 100
2 ms640 KiB
#include "tickets.h" #include <bits/stdc++.h> using namespace std; long long find_maximum(int k, std::vector<std::vector<int>> x) { int n = x.size(), m = x[0].size(); vector<long long> s; for (int i = 0; i < n; i++) s.push_back(x[i][0]); sort(s.begin(), s.end()); long long si = 0; for (int i = 0; i < n / 2; i++) si += s[i + n / 2] - s[i]; allocate_tickets(vector<vector<int> >(n, vector<int>(m))); return si; }
#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...