제출 #261576

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
261576		c4ts0up	쌀 창고 (IOI11_ricehub)	C++17	42 / 100	1089 ms	1044 KiB

ricehub

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

vector <ll> arr;

ll RO(ll budget, ll cord) {
	priority_queue <ll, vector <ll>, greater <ll> > pq;
	
	for (ll x : arr) pq.push(abs(x-cord));
	
	ll paks = 0, suma = 0;
	
	while (!pq.empty() && suma <= budget) {
		ll curr = pq.top();
		pq.pop();
		
		if (suma + curr <= budget) suma += curr, paks++;
		else break;
	}
	
	return paks;
}

int besthub(int R, int L, int X[], ll B) {
	for (ll i=0; i<R; i++) arr.push_back((ll)X[i]);
	
	ll maxi = 0;
	for (ll i=1; i<=L; i++) {
		maxi = max(maxi, RO(B, i));
	}
	return maxi;
}

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 0 / 26
• Subtask 4: 0 / 32