Submission #336075

#	Time	Username	Problem	Language	Result	Execution time	Memory
336075		saarang123	Rice Hub (IOI11_ricehub)	C++14	0 / 100	25 ms	1384 KiB

ricehub

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

int besthub(int N, int L, int A[], long long B) {
    int median;
    if(N % 2) median = A[N / 2];
    else median = (A[N / 2 - 1] + A[N / 2]) / 2;
    vector<int> distance;
    for(int i = 0; i < N; i++)
        distance.push_back(abs(A[i] - median));
    sort(distance.begin(), distance.end());
    int answer = 0;
    long long cost = 0;
    for(int i = 0; i < N; i++)
        if(cost + distance[i] <= B) {
            cost += distance[i];
            answer++;
        }
    return answer;
}

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