Submission #522710

#TimeUsernameProblemLanguageResultExecution timeMemory
522710jamezzzCarnival Tickets (IOI20_tickets)C++17
11 / 100
1 ms716 KiB
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define pb push_back
#define all(x) x.begin(),x.end()

ll find_maximum(int k,vector<vector<int>> x){
	int n=x.size();
	int m=x[0].size();
	assert(m==1);
	
	vector<vector<int>> answer;
	answer.resize(n);
	for(int i=0;i<n;++i)answer[i].resize(m,0);
	
	vector<int> v;
	for(int i=0;i<n;++i)v.pb(x[i][0]);
	sort(all(v));
	
	ll mx=0;
	for(int i=0;i<n;++i){
		mx+=abs(v[i]-v[n/2]);
	}
	
	allocate_tickets(answer);
	return mx;
}
#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...