# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224724 | Cameyoshi | 쌀 창고 (IOI11_ricehub) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int besthub(int R,int L,int x[],long long B)
{
int mn=2000000001;
int sol;
for(int i=0;i<L;i++){
int s=0;
int c=0;
vector<int>V;
for(int j=0;j<X.size();j++)V.push_back(abs(i-X[j]);
sort(V.begin(),V.end());
for(int j=0;j<V.size();j++){
if(s+V[j]<=B){}
}
}
return 0;
}