Submission #467675

#TimeUsernameProblemLanguageResultExecution timeMemory
467675jam_xd_Rice Hub (IOI11_ricehub)C++17
68 / 100
1096 ms460 KiB
#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++){

        vector<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<R;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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...