Submission #950433

#TimeUsernameProblemLanguageResultExecution timeMemory
950433irmuunRice Hub (IOI11_ricehub)C++17
42 / 100
1033 ms1728 KiB
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int besthub(int R,int L,int X[],ll B){
    int ans=0;
    for(int i=0;i<=L;i++){
        ll cost=0;
        int cur=0;
        vector<ll>dist;
        for(int j=0;j<R;j++){
            dist.pb(abs(X[j]-i));
        }
        sort(all(dist));
        for(int j=0;j<R;j++){
            if(cost+dist[j]<=B){
                cost+=dist[j];
                cur++;
            }
            else break;
        }
        ans=max(ans,cur);
    }
    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...