제출 #352499

#제출 시각아이디문제언어결과실행 시간메모리
352499nicholask쌀 창고 (IOI11_ricehub)C++14
0 / 100
33 ms1644 KiB
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int R, int L, int X[], long long B){
	int m=X[(R-1)/2];
	long long d[R];
	for (int i=0; i<R; i++) d[i]=abs(X[i]-m);
	sort(d,d+R);
	for (int i=0; i<R; i++){
		if (B>=d[i]) B-=d[i];
		else return i;
	}
	return R;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...