Cod sursă (job #495531)

#include <bits/stdc++.h>

using namespace std;

int n, d, x, k, num, nr, dr, v[5000005];

int main()
{
	ifstream cin("lalele.in");
	ofstream cout("lalele.out");
    cin >> n;
    while(k!=n)
    {
        cin >> d >> x;
        if(x>0)
        {
            k+=d;
            for(int i=1; i<=d; i++)
            v[++num]=x+i-1-k;
            num+=d;
        }
        else
        {
            for(int i=1; i<=d; i++)
            {
                k++;
                nr = num/2 + num%2;
                nth_element(v+1, v+num-nr+1, v+num+1);

            cout << v[num-nr+1]+k << "\n";
            num-=nr;
            }
        }
    }
return 0;}