Submission #224658

#TimeUsernameProblemLanguageResultExecution timeMemory
224658jhtanRice Hub (IOI11_ricehub)C++14
0 / 100
1087 ms912 KiB
#include "ricehub.h"
#include "bits/stdc++.h"

using namespace std;

int besthub(int R, int L, int X[], long long B)
{
  int mn = 2000000001;
  int sol = 0;
  
  for(int i=1; i<=L; i++) {
    int s = 0, c = 0;
    vector<int> V;
    for(int j=0; j<R; j++) V.push_back(abs(i-X[j]));
    sort(V.begin(), V.end());

    for(int j=0; j<R; j++) {
      if(s + V[j] <= B) {s += V[j]; c++;}
      else break;
    }

    if(s < mn) {
      mn = s;
      sol = c;
    }
  }
  
  return sol;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...