제출 #829984

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