Cod sursă (job #486213)

#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

ifstream f("lalele.in");
ofstream g("lalele.out");
 int a[5000001];
int main()
{
    int n,d,x ,z=0,cnt=0,i;
    f>>n;
    while(n>0)
    {
        f>>d>>x;
        n=n-d;
        if(x>0)
        {
        cnt=cnt+d;
        for(i=1; i<=d; ++i)
            {
                ++z;
                a[z]=x+i-1-cnt;
            }
        }
        else
        {
            for(i=1; i<=d; ++i)
            {
                ++cnt;
                nth_element(a+1,a+z/2+1,a+z+1);
                g<<a[(z+2)/2]+cnt<<endl;
                z/=2;
        }
    }
    }
    return 0;
}