Submission #805143

#	Time	Username	Problem	Language	Result	Execution time	Memory
805143		Kerim	쌀 창고 (IOI11_ricehub)	C++17	42 / 100	1069 ms	736 KiB

ricehub

#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 answer = 0;
    for (int i = 1; i <= L; i++){
        vector<int> dist;
        for (int j = 0; j < R; j++)
            dist.push_back(abs(X[j] - i));
        sort(dist.begin(), dist.end());
        ll budget = 0;
        int count = 0;
        for (auto x: dist){
            budget += x;
            if (budget > B)
                break;
            count += 1;
        }
        answer = max(answer, count);
    }
    return answer;
}

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