# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
467670 | jam_xd_ | Rice Hub (IOI11_ricehub) | C++17 | 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 "ricehub.h"
#include <bits/stdc++.h>
using namespace std; //si solo era esto me muero >:v.
int besthub(int R, int L, int X[], long long B)
{
long long suma_d=0, campos=0;
long long jamon=0;//auxiliar
for(int i=0;i<R;i++){
long long diferencias[R];
for(int j=0;j<R;j++)diferencias[j] = abs(X[i]-X[j]);
sort(diferencias.begin(), diferencias.end());
for(int k=0;k<diferencias.size();k++){
if(suma_d + diferencias[k] <= B){
suma_d += diferencias[k];
campos++;
}else break;
}
long long maximo = max(jamon, campos);
jamon = maximo;
suma_d=0;
campos=0;
}
return jamon;
}