제출 #800124

#제출 시각아이디문제언어결과실행 시간메모리
800124alvingogo카니발 티켓 (IOI20_tickets)C++14
0 / 100
1 ms340 KiB
#include "tickets.h" #include <vector> #include <bits/stdc++.h> #pragma GCC optimize("Ofast") #define fs first #define sc second #define p_q priority_queue using namespace std; typedef long long ll; long long find_maximum(int k, vector<vector<int>> x) { int n = x.size(); int m = x[0].size(); vector<int> v; ll ret=0; vector<vector<int> > ans(n,vector<int>(m)); for(int i=0;i<n;i++){ ans[i][0]=0; v.push_back(x[i][0]); } sort(v.begin(),v.end()); for(int i=0;i<n/2;i++){ ret-=v[i]; ret+=v[i+n/2]; } allocate_tickets(ans); 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...