Cod sursă (job #485956)

#include <bits/stdc++.h>

using namespace std;

long long p[5000001];

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

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