제출 #430791

#제출 시각아이디문제언어결과실행 시간메모리
430791juggernaut카니발 티켓 (IOI20_tickets)C++17
11 / 100
2 ms716 KiB
#include"tickets.h" #include<bits/stdc++.h> using namespace std; #ifndef EVAL #include"grader.cpp" #endif typedef long long ll; ll find_maximum(int k,vector<vector<int>>x){ int n=x.size(); int m=x[0].size(); vector<vector<int>>answer; answer.assign(n,vector<int>(m,-1)); vector<pair<int,int>>vec; ll sum=0; for(int i=0;i<n;i++) vec.emplace_back(x[i][m-1],i); sort(vec.rbegin(),vec.rend()); for(int i=0;i<n/2;i++){ sum+=vec[i].first; answer[vec[i].second][m-1]=0; } for(int i=0;i<n;i++)if(answer[i][m-1]!=0)answer[i][0]=0,sum-=x[i][0]; allocate_tickets(answer); return sum; }
#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...