제출 #1199637

#제출 시각아이디문제언어결과실행 시간메모리
1199637prikpaoRice Hub (IOI11_ricehub)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h> #include "ricehub.h" using ll = long long; using namespace std; int besthub(int n, int l, int x[], ll b){ vector<int> v; for(int i=0; i<n; i++)v.push_back(abs(x[i]-x[n/2])); sort(v.begin(), v.end()); int val=b, i; for(i=0; i<n; i++){ if(val<v[i])break; val-=v[i]; } int ans=i; if(n%2==0){ v.clear(); for(i=0; i<n; i++)v.push_back(abs(x[i]-x[(n+1)/2])); sort(v.begin(), v.end()); int val=b, i; for(i=0; i<n; i++){ if(val<v[i])break; val-=v[i]; } ans=max(ans, i); } 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...