제출 #241068

#제출 시각아이디문제언어결과실행 시간메모리
241068lakshith_쌀 창고 (IOI11_ricehub)C++14
17 / 100
1085 ms1184 KiB
#include <bits/stdc++.h> #include "ricehub.h" #define ll long long #define pb push_back using namespace std; inline ll min(ll a,ll b){ return a<b?a:b; } inline ll max(ll a,ll b){ return a<b?b:a; } inline ll abs(ll a,ll b){ return max(a,b)-min(a,b); } int besthub(int r,int l,int x[],ll b){ int MAX = 0; for(int i=0;i<r;i++){ vector<ll> vec; for(int j=0;j<r;j++){ vec.pb(abs(x[i],x[j])); } sort(vec.begin(),vec.end()); int Count = 0; ll cost = b; while(cost>0){ if(vec[Count]<=cost) cost -= vec[Count++]; else break; } MAX = max(MAX,Count); } return MAX; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...