Cod sursă (job #417933)

#include <bits/stdc++.h>
using namespace std;
ifstream f("lalele.in");
ofstream g("lalele.out");
int n,r,d,x,k,i,a[5000005];
int main()
{
    f>>n;
    while(r<n)
    {
        f>>d>>x;
       if(x!=0)
       {
           r=r+d;
           for(int i=1;i<=d;i++)
            a[++k]=x+i-1-r;
       }
       else
       {
           sort(a+1,a+k+1);
           for(int i=1;i<=d;i++)
           {
               r++;
               g<<a[k/2+1]+r<<'\n';
               k/=2;
           }
    }
    }
    return 0;
}