| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1048681 | AndreasK | 쌀 창고 (IOI11_ricehub) | C++14 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define designed ios_base::sync_with_stdio(0);
#define by cin.tie(0);
#define AndreasK cout.tie(0);
#define int long long
#define ii pair <int,int>
#define vi vector <int>
#define iii pair <int,ii>
#define vii vector <ii>
#define vc vector <char>
#define vb vector <bool>
int answer(int32_t R, int32_t L, int32_t X[], long long B)
{
  int mx=0;
    for (int c=1;c<=L;c++){
        vector <int> a;
        for (int r=0;r<R;r++)
            a.push_back(abs(X[r]-c));
        sort(a.begin(),a.end());
        int ttl=0;
        int b=B;
        for (int r=0;r<R;r++){
            if (a[r]<=b){
                b-=a[r];
                ttl++;
            }
        }
        mx=max(mx,ttl);
    }
    return mx;
}
