Submission #307702

#TimeUsernameProblemLanguageResultExecution timeMemory
307702tengiz05Rice Hub (IOI11_ricehub)C++17
43 / 100
1084 ms1164 KiB
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int a[N], n;
long long b;
int check(int pos){
	vector<int> v;
	for(int i=0;i<n;i++){
		v.push_back(abs(a[i]-pos));
	}sort(v.begin(), v.end());
	int i=0;
	long long B = b;
	int cnt = 0;
	while(i < n && B > 0){
		if(v[i] > B)break;
		B -= (long long)v[i], i++;
		cnt++;
	}return cnt;
}
int besthub(int R, int L, int X[], long long B){
	n = R;
	b = B;
	for(int i=0;i<n;i++)a[i] = X[i];
	int ans = 0;
	for(int i=0;i<n;i++){
		ans = max(check(a[i]), ans);
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...