Cod sursă (job #486232)

#include <bits/stdc++.h>

using namespace std;
ifstream in("lalele.in");
ofstream out("lalele.out");
struct lalea{
    int val,zi;
};

int v[5000001];

int main()
{
    int n,i,s=0,nr(0),z=1,d,x,j;
    in>>n;
    int adaugat=0;
    while(s<n)
    {
        in>>d>>x;
        s+=d;
        if(x==0)
        {
             for(i=1; i<=d; i++)
            {
                adaugat++;
                nth_element(v+1, v+nr/2+1, v+nr+1);
                out<<v[nr/2+1]+adaugat<<'\n';
                nr/=2;
            }
        }
        else
        {

            adaugat=adaugat+d;
            for(i=1; i<=d; i++)
            {
                nr++;
                v[nr]=x+i-adaugat-1;
            }
        }

    }
    return 0;
}