Cod sursă (job #485987)

#include <bits/stdc++.h>

using namespace std;

ifstream in ("lalele.in");
ofstream out ("lalele.out");

int v[5000005];

int main()
{
    int n,zile,d,x,tottrecute=0,i,p;
    in>>n;
    zile=0;
    while(n>0)
    {
        in>>d>>x;
        n-=d;
        if(x)
        {
            tottrecute+=d;
            for(i=1; i<=d; i++,zile++)
            {
                v[zile]=x+i-1-tottrecute;
            }
        }
        else
        {
            for(i=1; i<=d; i++)
            {
                tottrecute++;
                nth_element(v+1,v+zile/2+1,v+zile+1);
                out<<v[(zile+2)/2]+tottrecute<<'\n';
                zile/=2;
            }
        }
    }
    return 0;
}