Submission #820100

#	Time	Username	Problem	Language	Result	Execution time	Memory
820100		nemethm	Rice Hub (IOI11_ricehub)	C++17	42 / 100	1074 ms	864 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long int;

int besthub(int R, int L, int X[], long long B)
{
  int ans = 0;
  for(int i = 1; i <= L; ++i){
    priority_queue<int> q;
    for(int j = 0; j < R; ++j){
      q.push(-abs(i - X[j]));
    }
    ll cost = 0;
    int actual = 0;
    while(!q.empty() && cost + (-q.top()) <= B){
      ++actual;
      cost += -q.top();
      q.pop();
    }
    ans = max(ans, actual);
  }
  return ans;
}

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 0 / 26
• Subtask 4: 0 / 32