제출 #1270750

#제출 시각아이디문제언어결과실행 시간메모리
1270750abdelhakimCarnival Tickets (IOI20_tickets)C++20
11 / 100
1 ms840 KiB
#include "tickets.h" #include <bits/stdc++.h> #define dbg(x) cerr<<#x<<' '<<x<<endl; #define ll long long using namespace std; void printvec(vector<ll>& vec) { for (auto &&e : vec) { cout << e << ' '; } cout << endl; } long long find_maximum(int k, std::vector<std::vector<int>> x) { int n = x.size(); int m = x[0].size(); vector<ll> v(n); for (int i=0;i<n;i++) { v[i]=x[i][0]; } sort(v.begin(), v.end()); ll med=v[n/2]; ll val=0; for (int i=0;i<n;i++) { val+=abs(med-v[i]); } vector<vector<int>> ans(n,vector<int>(m,0)); allocate_tickets(ans); return val; }
#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...