제출 #430775

#제출 시각아이디문제언어결과실행 시간메모리
430775juggernaut카니발 티켓 (IOI20_tickets)C++17
11 / 100
4 ms588 KiB
#include"tickets.h"
#include<bits/stdc++.h>
using namespace std;
#ifndef EVAL
#include"grader.cpp"
#endif
typedef long long ll;
bool cmp(vector<int>l,vector<int>r){
    return l[0]<r[0];
}
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,0));
	ll sum=0;
	sort(x.begin(),x.end(),cmp);
	allocate_tickets(answer);
	for(int i=0;i<n/2;i++)sum-=x[i][0];
	for(int i=n/2;i<n;i++)sum+=x[i][0];
	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...