Submission #201192

#TimeUsernameProblemLanguageResultExecution timeMemory
201192DavidDamianRice Hub (IOI11_ricehub)C++11
0 / 100
1079 ms504 KiB
#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int besthub(int N, int L, int X[], ll B)
{
    int maximum=0;
    for(int i=1;i<=L;i++){
        ll money=B;
        int total=0;
        for(int j=0;j<N;j++){
            if(money>=abs(i-X[j])){
                money-=abs(i-X[j]);
                total++;
            }
        }
        maximum=max(maximum,total);
    }
    return maximum;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...