Cod sursă (job #417860)

#include <bits/stdc++.h>

using namespace std;
int x,d,a[5000100],n,k,r;
int main()
{
   freopen("lalele.in","r",stdin);
   freopen("lalele.out","w",stdout);
   scanf("%d",&n);
   while(scanf("%d%d",&d,&x)!=EOF)
   {
       if(x!=0)
       {
           r+=d;
           for(int i=1;i<=d;i++)
            a[++k]=x+i-1-r;
       }
       else
       {
           for(int i=1;i<=d;i++)
           {
               r++;
               nth_element(a+1,a+k/2+1,a+k+1);
               cout<<a[k/2+1]+r<<'\n';
               k/=2;
           }
       }
   }
   return 0;
}