Cod sursă (job #495092)

#include <bits/stdc++.h>
using namespace std;

long long p[5000001];



int main () {
ifstream fin ("lalele.in");
ofstream fout ("lalele.out");

long long zile=0,z,d,n,t=0,tottrecute=0,i;
fin>>n;
while (fin>>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);
fout<<p[zile/2+1]+tottrecute<<endl;
zile/=2;
}
}
}
return 0;
}