Submission #364038

#TimeUsernameProblemLanguageResultExecution timeMemory
364038wind_reaperCarnival Tickets (IOI20_tickets)C++17
11 / 100
2 ms748 KiB
#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;

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

	vector<vector<int>> ans(n, vector<int>(m));

	long long a = 0; 

	vector<int64_t> t(n);

	for(int i = 0; i < n; i++){
		ans[i][0] = 0;
		t[i] = x[i][0];
	}
	sort(t.begin(), t.end());
	int64_t median = t[n/2];

	for(int i = 0; i < n; i++)
		a += 1LL*abs(median - t[i]);
	allocate_tickets(ans);
	return a;
}
#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...