제출 #467645

#제출 시각아이디문제언어결과실행 시간메모리
467645pere_gilRice Hub (IOI11_ricehub)C++14
68 / 100
1081 ms684 KiB
#include "ricehub.h"
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;

ll get(int x, int n, int v[], ll b){
	vector<ll> cost(n);
	for(int i=0;i<n;i++)
		cost[i]=abs(x-v[i]);
	sort(cost.begin(),cost.end());
	ll res=0;
	ll act_cost=0;
	for(int i=0;i<n;i++){
		if(act_cost+cost[i]<=b){
			act_cost+=cost[i];
			res++;
		}
		else return res;
	}
	return res;
}

int besthub(int n, int r, int v[], ll b){
	ll res=0;
	for(int i=0;i<n;i++)
		res=max(res,get(v[i],n,v,b));
	
	return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...