# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950442 | 2024-03-20T10:13:31 Z | irmuun | Rice Hub (IOI11_ricehub) | C++17 | 0 ms | 0 KB |
#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<R;i++){ ll cost=0; int cur=0; vector<ll>dist; for(int j=0;j<R;j++){ dist.pb(abs(X[j]-x[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; }