Cod sursă (job #699633)

#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("lalele.in");
ofstream fout("lalele.out");
int n,j,k,d,x,v[6000005];
int main()
{
    fin>>n;
    while(fin>>d>>x)
    {
        for(j=1; j<=k; j++) v[j]+=d;
        if(x>0)
        {
            for(j=1; j<=d; j++)
            {
                k++;
                v[k]=x+j;
            }
        }
        else
        {
            sort(v+1,v+k+1);
            for(j=1; j<=d; j++)
            {
                fout<<v[k/2+1]-(d-j)-1<<'\n';
                k=k/2;
            }
        }
    }
    return 0;
}