Submission #345051

#TimeUsernameProblemLanguageResultExecution timeMemory
345051daniel920712Rice Hub (IOI11_ricehub)C++14
68 / 100
1090 ms876 KiB
#include "ricehub.h"
#include <algorithm>
#include <vector>
using namespace std;
vector < long long > all;
int besthub(int R, int L, int X[], long long B)
{
    long long now=0,ans=0,i,j;
    for(i=0;i<R;i++)
    {
        all.clear();
        for(j=0;j<R;j++) all.push_back((long long) abs(X[j]-X[i]));
        sort(all.begin(),all.end());
        now=0;
        for(j=0;j<R;j++)
        {
            ///printf("%d %lld\n",i,all[j]);
            if(now+all[j]>B) break;
            now+=all[j];
        }
        ans=max(ans,j);
    }
    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...