Pagini recente » Cod sursa (job #1622603) | Cod sursa (job #2240937) | Cod sursa (job #1863926) | Cod sursa (job #2514026) | Cod sursa (job #989955)
Cod sursa(job #989955)
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
using namespace std;
int N, V[50001], Sign[50001];
long long S, CS;
vector<int> Pos, Neg;
int main()
{
srand(time(0));
freopen("semne.in", "r", stdin);
freopen("semne.out", "w", stdout);
scanf("%i %lld", &N, &S);
for(int i = 1; i <= N; ++ i)
{
scanf("%i", &V[i]);
if(CS + V[i] <= S)
{
Pos.push_back(i);
CS += V[i];
Sign[i] = 1;
}else
{
Neg.push_back(i);
CS -= V[i];
Sign[i] = -1;
}
}
while(CS != S)
{
if(CS > S)
{
int Elim = rand() % Pos.size(), PosElim = Pos[Elim];
Sign[PosElim] = -1;
CS -= 2 * V[PosElim];
Neg.push_back(PosElim);
Pos[Elim] = Pos[Pos.size() - 1];
Pos.pop_back();
}else
{
int Elim = rand() % Neg.size(), PosElim = Neg[Elim];
Sign[PosElim] = 1;
CS += 2 * V[PosElim];
Pos.push_back(PosElim);
Neg[Elim] = Neg[Neg.size() - 1];
Neg.pop_back();
}
}
for(int i = 1; i <= N; ++ i)
printf("%c", (Sign[i] == 1 ? '+' : '-'));
return 0;
}