Cod sursă (job #417964)

#include <fstream>
#include <algorithm>
using namespace std;
int n, nr, d, x, v[5000001], jum;
int main()
{
    ifstream fin("lalele.in");
    ofstream fout("lalele.out");
    fin >> n;
    nr = 0;
    while (n>0) {
        fin >> d >> x;
        n = n-d;
        if (x>0) {
            for (int i=1;i<=nr;i++) v[i]+=d;
            int a = nr+1;
            int b = nr+d;
            nr = nr+d;
            d--;
            for (int i=a;i<=b;i++) {
                v[i] = x+d;
                d--;
            }
        }
        else {
            sort (v+1,v+nr+1);
            for (int i=1;i<=nr;i++) v[i]++;
            for (int h=1;h<=d;h++) {
                jum = nr/2+1;
                fout << v[jum] << '\n';
                nr = nr/2;
                for (int i=1;i<=nr;i++) v[i]++;
            }
        }

    }
    return 0;
}