Pagini recente »
Clasament ix_test8
|
Clasament cel_mai_greu_concurs_luca_prunoiu
|
Clasament lord-of-informaticaa
|
Borderou de evaluare (job #386095)
|
Cod sursă (job #495651)
Cod sursă (job
#495651)
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
static int n, d, i, x, j, a[700000000], k, b[700000000], dd;
int main(){
ifstream cin("lalele.in");
ofstream cout("lalele.out");
cin>>n; i=0; k=0;
while(n>0){ cin>>d; dd=d;
cin>>x;
if(x>0) {
while(d){ i++;
a[i]=x;
for(j=1; j<i; j++) a[j]++;
d--;
}
}
else while(d){ sort(a+1, a+i+1);
k++;
b[k]=a[i/2+1];
for(j=(i/2+1); j<=i; j++) a[j]=0;
i/=2;
for(j=1; j<=i; j++) a[j]++;
d--;
}
n-=dd;
}
for(j=1; j<=k; j++) cout<<b[j]+1<<endl;
}