Pagini recente » Cod sursa (job #647675) | Istoria paginii postare-blogpost | Diferente pentru autumn-warmup-2007/solutii/runda-3 intre reviziile 51 si 50 | Cod sursa (job #2102279) | Cod sursa (job #204450)
Cod sursa(job #204450)
#include<stdio.h>
#include<iostream>
#include<stdlib.h>
#define N 50107
long long s,sum,a[N],n,min[N],pl[N],p,k;
char u[N];
int main(){
int i,x;
freopen("semne.in","r",stdin);
freopen("semne.out","w",stdout);
scanf("%lld%lld",&n,&s);
for(i=1;i<=n;++i){
scanf("%lld",&a[i]);
if(sum+a[i]<=s)
u[i]='+',sum+=a[i],pl[++p]=i;
else
sum-=a[i], u[i]='-',min[++k]=i;
}
srand(time(0));
while(sum!=s){
if(sum<s){
x=rand()%k+1;
sum+=2*a[min[x]];
pl[++p]=min[x];
u[min[x]]='+';
min[x]=min[k];
k--;
}
else{
x=rand()%p+1;
sum-=2*a[pl[x]];
min[++k]=pl[x];
u[pl[x]]='-';
pl[x]=pl[p];
--p;
}
}
for(i=1;i<=n;++i)
printf("%c",u[i]);
fclose(stdin);
fclose(stdout);
return 0;
}