제출 #794605

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
794605		MODDI	카니발 티켓 (IOI20_tickets)	C++14	0 / 100	0 ms	212 KiB

tickets

#include "tickets.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<int> vl;
ll find_maximum(int k, vector<vi> x) {
	int n = x.size();
	int m = x[0].size();
	if(m == 1){
		vi arr(n);
		for(int i = 0; i < n; i++)	arr.pb(x[i][0]);
		
		sort(arr.begin(), arr.end());
		ll choose = arr[n/2], rez = 0;
		vector<vi> ticket(n, vi(m, 0));
		allocate_tickets(ticket);
		for(int i = 0; i < n; i++){
			rez += abs(arr[i] - choose);
		}
		return rez;
	}
	
	
	
	return -1;
}

• Subtask 1: 0 / 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