제출 #1003330

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1003330		hacizadal	쌀 창고 (IOI11_ricehub)	C++17	42 / 100	1062 ms	1084 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pll pair<ll, ll>

int besthub(int n, int l, int a[], long long b)
{
    ll mx = 0;
    for (ll i = 0; i<n; i++){
        priority_queue<ll, vector<ll>, greater<ll>>pq;
        for (ll j = 0; j<n; j++){
            pq.push(abs(a[j] - a[i]));
        }
        ll sum = 0, cnt = 0;
        while (pq.size()){
            ll x = pq.top();
            pq.pop();
            sum += x;
            cnt++;
            if (sum > b){
                sum -= x;
                cnt--;
                break;
            }
        }
        mx = max(mx, cnt);
    }
    return mx;
}

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