Cod sursă (job #495385)
Utilizator |
|
IP | ascuns |
---|---|---|---|
Problemă | Lalele (clasele 9-10) | Compilator | cpp | 0,66 kb |
Rundă | lasm_22_10_cl11_12 | Status | evaluat |
Dată | 22 oct. 2019 22:19:18 | Scor | 0 |
#include<bits/stdc++.h>
using namespace std;
int n,d,x,nr,a[5000010];
int main(){
ifstream cin("lalele.in");
ofstream cout("lalele.out");
cin>>n;
while(n!=0){
cin>>d>>x;
if(x!=0){
for(int j=1;j<=nr;j++)
a[j]+=d;
for(int j=1;j<=d;j++)
a[++nr]=x++;
}
else{
sort(a+1,a+1+nr);
for(int j=1;j<=d;j++){
for(int j=1;j<=nr;j++)
a[j]++;
int mij=(nr+1)/2;
cout<<a[mij+1]<<'\n';
nr-=mij;
}
}
n-=d;
}
return 0;
}