제출 #1034111

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1034111		Gray	카니발 티켓 (IOI20_tickets)	C++17	11 / 100	1 ms	604 KiB

tickets

#include "tickets.h"
#include <algorithm>
#include <vector>

#define ll long long
#define ff first
#define ss second
#define ln "\n"

using namespace std;

long long outcome(vector<int> &round){
	sort(round.begin(), round.end());
	ll med = round[round.size()/2];
	ll ans=0;
	for (auto ch:round){
		ans+=abs(ch-med);
	}
	return ans;
}


long long find_maximum(int k, std::vector<std::vector<int>> x) {
	ll n = x.size(), m=x[0].size();
	vector<vector<int>> answer(n, vector<int>(m, 0));
	allocate_tickets(answer);
	vector<int> round(n);
	for (ll i=0; i<n; i++) round[i]=x[i][0];
	return outcome(round);
}

• 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