Submission #1216676

#TimeUsernameProblemLanguageResultExecution timeMemory
1216676semiautoRice Hub (IOI11_ricehub)C++20
68 / 100
1096 ms460 KiB
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int x[], long long B)
{
  int ans = 0;
  for (int i = 0; i < R; i++) {
    int a[R];
    for (int j = 0; j < R; j++) {
      a[j] = abs(x[i] - x[j]);
    }
    sort(a, a + R);
    long long sum = B;
    int cur = 0;
    for (int j = 0; j < R; j++) {
      if (a[j] > sum) {
        break;
      }
      sum -= a[j];
      cur++;
    }
    ans = max(ans, cur);
  }
  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...