Submission #799432

#	Time	Username	Problem	Language	Result	Execution time	Memory
799432		Liudas	쌀 창고 (IOI11_ricehub)	C++17	42 / 100	1088 ms	724 KiB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int N, int L, int arr[], long long B){
    vector<int> brr;
    for(int i = 0; i < N; i ++){
        brr.push_back(arr[i]);
    }
    int best = 0;
    for(int i = 0; i <= L; i ++){
        int T = B, ans = 0;
        sort(brr.begin(), brr.end(), [&](int a, int b){return abs(a-i) < abs(b-i);});
        for(int j : brr){
            if(abs(j-i) > T)break;
            ans ++;
            T -= abs(j-i);
        }
        best = max(best, ans);
    }
    return best;
}

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