Cod sursă (job #486227)

//
//  main.cpp
//  Lalele
//
//  Created by Sabin Andrei on 9/15/19.
//  Copyright © 2019 Sabin Andrei. All rights reserved.
//

#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

int n,d,x,v[5000010],k,r;

int main()
{
    in>>n;
    while(in>>d>>x)
    {
        if(x!=0)
        {
            r+=d;
            for(int i=1;i<=d;i++)
            {
                v[++k]=x+i-1-r;
            }
        }
        else
        {
            for(int i=1;i<=d;i++)
            {
                r++;
                nth_element(v+1, v+k/2+1, v+k+1);
                out<<v[k/2+1]+r<<'\n';
                k/=2;
            }
        }
    }
}