Submission #743124

#TimeUsernameProblemLanguageResultExecution timeMemory
743124vjudge1Rice Hub (IOI11_ricehub)C++17
42 / 100
1070 ms724 KiB
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 1;
priority_queue<long long, vector<long long>, greater<long long>> q;
int besthub(int R, int L, int X[], long long B)
{
  int ans = 0;
  for(int i=0;i<R;i++) {
    while (!q.empty()) q.pop();
    for(int j=0;j<R;j++) {
      q.push(abs(X[i] - X[j]));
    }
    long long cou = 0;
    int now = 0;
    while (!q.empty()) {
      long long t = q.top(); q.pop();
      cou += t;
      if (cou>B) break;
      now++;
    }
    ans = max(ans, now);
  }
  
  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...