Submission #1221136

#	Time	Username	Problem	Language	Result	Execution time	Memory
1221136		SpyrosAliv	쌀 창고 (IOI11_ricehub)	C++20	68 / 100	1094 ms	800 KiB

ricehub

#include <bits/stdc++.h>
using namespace std;
#define ll long long

int besthub(int R, int L, int X[], ll B) {
    vector<int> coords;
    int n = R;
    ll b = B;
    for (int i = 0; i < n; i++) coords.push_back(X[i]);
    int maxAns = 0;
    for (int i = 0; i < n; i++) {
        vector<int> dis;
        for (int j = 0; j < n; j++) {
            dis.push_back(abs(coords[i] - coords[j]));
        }
        sort(dis.begin(), dis.end());
        ll curr = 0;
        int tot = 0;
        for (int i = 0; i < n; i++) {
            curr += dis[i];
            if (curr > b) break;
            tot++;
        }
        maxAns = max(maxAns, tot);
    }
    return maxAns;
}

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