# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
111227 | kingfran1907 | Rice Hub (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;
const int maxn = 1e5+10;
int n, m;
long long k;
int niz[maxn];
long long cost(int x, int y) {
int med = niz[(x + y) / 2];
long long out = 0;
for (int i = x; i <= y; i++)
out += abs(niz[i] - med);
return out;
}
int main() {
scanf("%d%d%lld", &n, &m, &k);
for (int i = 0; i < n; i++)
scanf("%d", niz+i);
sort(niz, niz+n);
int ptr = 0, sol = 0;
long long tren = 0;
for (int i = 0; i < n; i++) {
int med = (i + ptr) / 2;
while (ptr < n - 1) {
int newmed = (i + ptr + 1) / 2;
long long cp = tren;
if (med != newmed) {
tren += (med - i) * (niz[newmed] - niz[med]);
tren -= (ptr - 1 - med) * (niz[newmed] - niz[med]);
}
ptr++;
med = newmed;
tren += niz[ptr] - niz[med];
if (tren > k) {
ptr--;
tren = cp;
break;
}
}
//printf("%d %d -> %lld (%lld)\n", i, ptr, tren, cost(i, ptr));
sol = max(sol, ptr - i + 1);
int newmed = (i + 1 + ptr) / 2;
if (med != newmed) {
tren += (med - i) * (niz[newmed] - niz[med]);
tren -= (ptr - newmed) * (niz[newmed] - niz[med]);
}
tren -= niz[newmed] - niz[i];
}
printf("%d", sol);
return 0;
}