-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA_Phoenix_and_Gold.cpp
65 lines (59 loc) · 1.16 KB
/
A_Phoenix_and_Gold.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
56
57
58
59
60
61
62
63
64
65
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int t;
cin >> t;
while (t--)
{
int n, x;
cin >> n >> x;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int skipped = -1;
int sum = 0;
sort(a, a + n);
for (int i = 0; i < n; i++)
{
if (sum + a[i] == x)
{
skipped = i;
break;
}
else
{
sum += a[i];
}
}
if (skipped == n - 1)
{
cout << "NO\n";
}
else if (skipped == -1)
{
cout << "YES\n";
for (int i = 0; i < n; i++)
{
cout << a[i] << " ";
}
cout << "\n";
}
else
{
cout << "YES\n";
for (int i = 0; i < n; i++)
{
if (i == skipped)
{
continue;
}
cout << a[i] << " ";
}
cout << a[skipped] << "\n";
}
}
}