Cod sursă (job #96668)

#include <stdio.h>
#include <algorithm>

using namespace std;

const int Nmax=5000005;
int v[Nmax];

int main(){
    FILE *in=fopen("lalele.in","r");
    FILE *out=fopen("lalele.out","w");

    int n,d,x,aux,nr=0; fscanf(in,"%d",&n);
    int nrz=0,nrc;
    while(n>0){
        fscanf(in,"%d%d",&d,&x);
        if(x==0){
            for(int i = 0 ; i < d ; i++){
                nrc=(nr>>1)+1;
                if(nr>nrc)
                    nth_element(v+1,v+nrc,v+nr+1);
                else if(nrc==2 && v[1]>v[2]){
                    aux=v[1];
                    v[1]=v[2];
                    v[2]=aux;
                }
                fprintf(out,"%d\n",v[nrc]+nrz);
                nr>>=1;
                nrz++;
            }
        }
        else{
            nrz+=d-1;
            for(int i = 0 ; i < d ; i++){
                v[++nr]=x-nrz;
                nrz--;
            }
            nrz+=d+1;
        }
        n-=d;
    }
    return 0;
}