forked from demonflow/hacktoberfest-----2022
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathStarter.cpp
55 lines (54 loc) · 1.08 KB
/
Starter.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
string s;
cin >> s;
int cp = 0, cm = 0;
vector<int> v;
for (int i = 0; i < n; ++i)
{
if (s[i] == '+')
cp++;
else if (s[i] == '-')
cm++;
else
{
v.push_back(s[i]);
}
}
sort(v.begin(), v.end());
string ans = "";
int l = cm + cp;
int q = v.size() - 1;
for (int i = q; i > v.size() - l - 1; --i)
{
ans += v[i];
if(v.size() > 0)
v.pop_back();
}
while (cp--)
{
ans += '+';
ans += v[v.size() - 1];
if(v.size() > 0)
v.pop_back();
}
while (cm--)
{
ans += '-';
ans += v[v.size() - 1];
if(v.size() > 0)
v.pop_back();
}
cout<<ans;
cout << endl;
}
return 0;
}