Cod sursă (job #417787)

#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("lalele.in");
ofstream fout ("lalele.out");
int A[5000005], N, i, d, x, K, cnt;
int main()
{
    fin >> N;
        while(fin >> d >> x) {
        if(x) {
            cnt += d;
            for(i = 1; i <= d; i++)
                A[++K] = x - cnt + i - 1;
        }
        else {
            for(i = 1; i <= d; i++) {
                cnt++;
                nth_element(A + 1, A + 1 + K - (K + 1) / 2, A + K + 1);
                printf("%d\n", A[K - (K + 1) / 2 + 1] + cnt);
                K -= (K + 1) / 2;
            }
        }
        if(cnt == N) break;
    }
    return 0;
}