Submission #557148

#	Time	Username	Problem	Language	Result	Execution time	Memory
557148		n0sk1ll	쌀 창고 (IOI11_ricehub)	C++14	68 / 100	1081 ms	884 KiB

ricehub

#include "ricehub.h"
#include<bits/stdc++.h>

using namespace std;
long long int typedef li;

int besthub(int n, int m, int x[], li b)
{
    int kolko=0;
    for (int i=0;i<n;i++)
    {
        vector<int> pom;
        for (int j=0;j<n;j++) pom.push_back(abs(x[i]-x[j]));
        sort(pom.begin(),pom.end());

        li tmp=b; int sta=0;
        for (int j=0;j<n;j++)
        {
            if (pom[j]>tmp) break;
            sta++; tmp-=pom[j];
        }
        kolko=max(kolko,sta);
    }
    return kolko;
}

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