Submission #783159

#TimeUsernameProblemLanguageResultExecution timeMemory
783159Minindu206Rice Hub (IOI11_ricehub)C++14
17 / 100
1067 ms340 KiB
#include "ricehub.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int besthub(int r, int l, int x[], long long b)
{
  int cost[r];
  int ans = 0;
  for(int i=0;i<l;i++)
  {
    for(int j=0;j<r;j++)
      cost[j] = (abs(i - x[j]));
    sort(cost, cost + r);
    ll sum = 0;
    int cur = 0;
    while(sum < b)
    {
      if(cur >= r)
        break;
      sum += cost[cur];
      cur++;
    }
    if(sum > b)
      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...