Cod sursă (job #184933)

#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("lalele.in");
ofstream fout("lalele.out");

int a[1000001];
int n;

int main()
{int d,x,nr,i,j,y;
fin>>n;
nr=0;
while(fin>>d)
     {fin>>x;
      if(x!=0)
        while(d!=0)
           if(d!=0)
            {for(j=1;j<=nr;j++)
                 a[j]++;
             nr++;a[nr]=x;
             d--;
            }

     if(x==0)
         {sort(a+1,a+nr+1);
           while(d!=0)
               if(d!=0)
                {y=nr/2+nr%2;
                 for(j=1;j<=nr;j++)
                    a[j]++;
                fout<<a[nr-y+1]<<"\n";
                nr=nr-y;
                d--;
               }
          }
    /*for(i=1;i<=nr;i++)
    fout<<a[i]<<" ";
     fout<<"\n";*/
    }
fin.close();
fout.close();
    return 0;
}