Submission #788650

#TimeUsernameProblemLanguageResultExecution timeMemory
788650TrumlingCarnival Tickets (IOI20_tickets)C++14
11 / 100
1 ms696 KiB
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();

	vector<vector<int>> answer(n,vector<int>(m,0));
	allocate_tickets(answer);

	vector<ll>v;
	for(int i=0;i<n;i++)
	v.pb(x[i][0]);

	sort(all(v));

	ll ans=0;
	for(int i=0;i<n;i++)
	ans+=abs(v[i]-v[n/2]);

	return ans;
}
#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...