Cod sursă (job #486009)

#include <bits/stdc++.h>

using namespace std;
ifstream in("lalele.in");
ofstream out("lalele.out");
int a[5000001];
int main()
{
    int n, d, z, zile=0, adaugat=0, i;
    in>>n;
    while(in>>z>>d)
    {
        if(d!=0)
        {
            adaugat=adaugat+z;
            for(i=1; i<=z; i++)
            {
                zile++;
                a[zile]=d+i-adaugat-1;
            }
        }
        else
        {
            for(i=1; i<=z; i++)
            {
                adaugat++;
                nth_element(a+1, a+zile/2+1, a+zile+1);
                out<<a[zile/2+1]+adaugat<<'\n';
                zile/=2;
            }
        }

    }




    return 0;
}