Submission #261536

#	Time	Username	Problem	Language	Result	Execution time	Memory
261536		s_avila_g	Rice Hub (IOI11_ricehub)	C++14	42 / 100	1068 ms	768 KiB

ricehub

#include <bits/stdc++.h>
using namespace std;
#include "ricehub.h"
typedef long long ll;
priority_queue<int,vector<int>, greater<int> > pq;

int besthub(int R, int L, int X[],ll B){
    ll n = R, ans = -1, act, sum;
    for(ll i = 1; i < L; i++){
        for(ll j = 0; j < n; j++){
            pq.push(abs(i - X[j]));
        }
        sum = act = 0;
        while(!pq.empty()){
            if(sum + pq.top() > B){
                pq.pop();
                continue;
            }else{
                sum += pq.top();
                act++;
            }
            pq.pop();
        }
        ans = max(ans,act);
    }
    return ans;
}

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