Submission #1362668

#	Time	Username	Problem	Language	Result	Execution time	Memory
1362668		maya_s	Carnival Tickets (IOI20_tickets)	C++20	11 / 100	1 ms	836 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

long long find_maximum(int k, vector<vector<int>> X) {
	ll n = X.size(), m = X[0].size();
	vector<vector<int>> allocations(n, {0});
	vector<vector<ll>> x(n, vector<ll>(m));
	for(ll i = 0; i < n; i++) for(ll j = 0; j < m; j++) x[i][j] = X[i][j];
	vector<ll> v(n);
	for(ll i = 0; i < n; i++) v[i] = x[i][0];
	sort(v.begin(), v.end());
	ll mid = v[(n-1)/2];
	ll ans = 0;
	for(ll i = 0; i < n; i++) ans += abs(v[i] - mid);
	allocate_tickets(allocations);
	return ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10