Submission #1259324

#	Time	Username	Problem	Language	Result	Execution time	Memory
1259324		kawhiet	쌀 창고 (IOI11_ricehub)	C++20	68 / 100	527 ms	327680 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;

int besthub(int n, int m, int arr[], long long k) {
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        a[i] = arr[i];
    }
    vector<vector<int>> d(n, vector<int>(n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            d[i][j] = abs(a[i] - a[j]);
        }
        sort(d[i].begin(), d[i].end());
    }
    int ans = 0;
    for (int i = 0; i < n; i++) {
        int cnt = 0;
        long long sum = 0;
        for (int j = 0; j < n; j++) {
            if (sum + d[i][j] <= k) {
                sum += d[i][j];
                cnt++;
            }
        }
        ans = max(ans, cnt);
    }
    return ans;
}

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