Submission #624229

#TimeUsernameProblemLanguageResultExecution timeMemory
624229Mr_HusanboyCarnival Tickets (IOI20_tickets)C++14
11 / 100
1 ms696 KiB
#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define ll long long

long long find_maximum(int k, vector<vector<int>> x) {

	sort(all(x));
	int n = x.size();
	vector<vi> ans(n,vi(1));
	allocate_tickets(ans);
	ll res = 0;
	for(auto u : x){
        res += abs(u.back()-x[n/2].back());
	}
	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...