제출 #301037

#제출 시각아이디문제언어결과실행 시간메모리
301037Nucleist카니발 티켓 (IOI20_tickets)C++14
0 / 100
1 ms256 KiB
#include "tickets.h" #include <bits/stdc++.h> #define sz(x) x.size() #define ve vector<int> #define pb push_back #define all(x) x.begin(),x.end() using namespace std; long long find_maximum(int k,vector<vector<int>> x) { int m=sz(x); ve cur; for (int i = 0; i < m; ++i) { cur.pb(x[i][0]); } sort(all(cur)); int in=cur[m/2]; int ans=0; for(auto it:cur){ ans+=abs(it-in); } 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...