Cod sursă (job #154273)

#include <stdio.h>
#include <algorithm>
#define nrflori 5000000
using namespace std;
int v[nrflori+1];
int main(){
    FILE *fin,*fout;
    fin=fopen("lalele.in","r");
    fout=fopen("lalele.out","w");
    int i=0,j,k=0,n,m,x,zile=0;
    fscanf(fin,"%d",&n);
    while(i<n){
        fscanf(fin,"%d%d",&m,&x);
        i+=m;
        if(x!=0){
            zile+=m;
            while(m!=0){
                k++;
                v[k]=x;
                m--;
            }
        }
        else{
            while(m!=0){
                j=1;
                while(j<zile){
                    v[k-j+1]+=j;
                    j++;
                }
                while(j<=k){
                    v[k-j+1]+=zile;
                    j++;
                }
                sort(v+1,v+k+1);
                zile=1;
                fprintf(fout,"%d\n",v[k/2+1]);
                k=k/2;
                m--;
            }
        }
    }
return 0;
}