Cod sursă (job #486222)

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