Cod sursă (job #486220)

#include <bits/stdc++.h>
using namespace std;
ifstream fin("lalele.in");
ofstream fout("lalele.out");
int v[5000004];
int main() {
    int n, d, z, day=0, cnt=0, i;
    fin>>n;
    while(cin>>z>>d) {
        if(d!=0) {
            cnt=cnt+z;
            for(i=1; i<=z; i++) {
                day++;
                v[day]=d+i-cnt-1;
            }
        } else {
            for(i=1; i<=z; i++) {
                cnt++;
                nth_element(v+1, v+day/2+1, v+day+1);
                fout<<v[day/2+1]+cnt<<'\n';
                day/=2;
            }
        }
    }
    return 0;
}