Submission #779193

#TimeUsernameProblemLanguageResultExecution timeMemory
779193JosiaCarnival Tickets (IOI20_tickets)C++17
11 / 100
1 ms724 KiB
#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;

#define int long long

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

	int res = 0;

	assert(m == 1);

	vector<int> vals;
	
	for (int i = 0; i<n; i++) {
		vals.push_back(x[i][0]);
	}

	sort(vals.begin(), vals.end());

	int med = vals[n/2];


	for (int i: vals) res += abs(i-med);
	

	vector<vector<signed>> cards(n, vector<signed>(m));

	for (int i=0; i<n; i++) {
		cards[i][0] = 0;
	}


	allocate_tickets(cards);
	return res;
}
#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...