제출 #407249

#제출 시각아이디문제언어결과실행 시간메모리
407249danielcm585Rice Hub (IOI11_ricehub)C++14
0 / 100
27 ms2400 KiB
#include "ricehub.h"

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

int besthub(int R, int L, int X[], ll B) {
    sort(X,X+R);
    int ans = 0;
    vector<int> v;
    for (int i = 0; i < R; i++) v.push_back(abs(X[i]-X[R/2]));
    sort(v.begin(),v.end());
    for (int i : v) {
        if (B < i) break;
        ans++;
        B -= i;
    }
    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...