이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |