Submission #537603

#	Time	Username	Problem	Language	Result	Execution time	Memory
537603		timreizin	쌀 창고 (IOI11_ricehub)	C++17	68 / 100	1092 ms	1456 KiB

ricehub

#include "ricehub.h"
#include <vector>
#include <algorithm>

using namespace std;

using ll = long long;

int besthub(int r, int l, int X[], ll b)
{
    vector<ll> x(r);
    for (int i = 0; i < r; ++i) x[i] = X[i];
    int maxRes = 0;
    for (int i = 0; i < r; ++i)
    {
        vector<ll> sorted;
        for (int j = 0; j < r; ++j) sorted.push_back(abs(x[i] - x[j]));
        sort(sorted.begin(), sorted.end());
        int res = 0;
        ll sum = 0;
        for (int j = 0; j < r; ++j)
        {
            if (sum + sorted[j] > b) break;
            sum += sorted[j];
            ++res;
        }
        maxRes = max(maxRes, res);
    }
    return maxRes;
}

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