Submission #1270744

#TimeUsernameProblemLanguageResultExecution timeMemory
1270744abdelhakimCarnival Tickets (IOI20_tickets)C++20
0 / 100
1 ms328 KiB
#include "tickets.h"
#include <bits/stdc++.h>
#define ll long long 
using namespace std;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<ll> v(n);
	for (int i=0;i<n;i++)
	{
		v.push_back(x[i][0]);
	}
	sort(v.begin(), v.end());
	ll med=v[n/2];
	ll val=0;
	for (int i=0;i<n;i++)
	{
		val+=abs(med-v[i]);
	}
	vector<vector<int>> ans(n,vector<int>(m,0));
	allocate_tickets(ans);
	return val;
}
#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...