Cod sursă (job #439653)

#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream f("lalele.in");
ofstream g("lalele.out");

int main()
{
    int n, d, x, i, loc = 0;
    f >> n;

    int v[n + 1];
    for (i = 1; i <= n; i++)
    {
        f >> d >> x;

        if (x == 0)
        {
            while (d)
            {
                for (int j = 1; j <= loc; j++)
                    v[j]++;

                if (loc == 2)
                    g << v[2] << '\n';
                else
                    g << v[(loc + 1) / 2] << '\n';
                loc = ((loc - 1) / 2);
                d--;
            }
        }

        else
        {
            while (d)
            {
                for (int j = 1; j <= loc; j++)
                    v[j]++;
                v[++loc] = x;
                d--;
            }
            sort(v + 1, v + loc + 1);
        }
    }
}