Cod sursă (job #495633)

Utilizator	Name Name BigBoss_29	IP	ascuns
Problemă	Lalele (clasele 9-10)	Compilator	cpp \| 0,79 kb
Rundă	lasm_22_10_cl11_12	Status	evaluat
Dată	22 oct. 2019 23:16:28	Scor	10

#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("lalele.in");
ofstream fout ("lalele.out");
int N, d, x, nr, V[1000];

int main()
{
    fin >> N;
    while(N)
    {
        fin >> d >> x;
        if (x)
        {
            for (int j = 1; j <= nr; j++)
                V[j] += d;
            for (int j = 1; j <= d; j++)
                V[++nr] = x++;
        }
        else
        {
            sort (V + 1, V + 1 + nr);
            for (int j = 1; j <= d; j++)
            {
                for (int j = 1; j <= nr; j++)
                    V[j] += 1;
                int mij = (nr + 1) / 2;
                if (nr & 1) fout << V[mij] << '\n';
                else fout << V[mij + 1] << '\n';
                nr -= mij;
            }
        }
        N -= d;
    }
    return 0;
}