Submission #302440

#	Time	Username	Problem	Language	Result	Execution time	Memory
302440		nhdtxdy	쌀 창고 (IOI11_ricehub)	C++17	42 / 100	1069 ms	788 KiB

ricehub

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

const int nax = 1e5 + 5;
int n, maxi, a[nax];
ll b;

// Subtask 3

int solve() {
	int ans = 0;
	for (int i = 1; i <= n; ++i) {
		// select a[i] as the position
		priority_queue<int, vector<int>, greater<int>> pq;
		for (int j = 1; j <= n; ++j) {
			pq.push(abs(a[i] - a[j]));
		}
		int cnt = 0, curr = 0;
		while (!pq.empty() && curr <= b) {
			++cnt;
			curr += pq.top();
			pq.pop();
		}
		if (curr > b) --cnt;
		ans = max(ans, cnt);
	}
	return ans;
}

int besthub(int R, int L, int X[], long long B) {
	n = R;
	maxi = L;
	for (int i = 0; i < R; ++i) a[i + 1] = X[i];
	b = B;
	return solve();
}

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