fork(1) download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. // Speed
  5. #define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
  6.  
  7. // Typedefs
  8. #define int long long
  9. #define pb push_back
  10. #define ff first
  11. #define ss second
  12. #define all(x) (x).begin(), (x).end()
  13. #define rall(x) (x).rbegin(), (x).rend()
  14. #define sz(x) ((int)(x).size())
  15. #define endl '\n'
  16. #define yes cout << "yes\n"
  17. #define no cout << "no\n"
  18.  
  19. // Loops
  20. #define rep(i,a,b) for(int i=a;i<b;++i)
  21. #define per(i,a,b) for(int i=b-1;i>=a;--i)
  22. #define each(x, a) for (auto& x : a)
  23.  
  24. // Consts
  25. const int INF = 1e18;
  26. const int MOD = 1e9+7;
  27. const int N = 2e5 + 5;
  28.  
  29. // Math
  30. int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
  31. int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
  32.  
  33. int power(int a, int b, int m = MOD) {
  34. int res = 1;
  35. while (b > 0) {
  36. if (b & 1) res = res * a % m;
  37. a = a * a % m;
  38. b >>= 1;
  39. }
  40. return res;
  41. }
  42.  
  43. int modinv(int a, int m = MOD) {
  44. return power(a, m - 2, m);
  45. }
  46.  
  47. // Logic
  48. void solve() {
  49. int n, s;
  50. cin >> n >> s;
  51.  
  52. int a[n];
  53. int sum = 0;
  54. int c = 0, count = 0, flag = 0;
  55.  
  56. for (int i = 0; i < n; i++) {
  57. cin >> a[i];
  58. sum += a[i];
  59.  
  60. if (a[i] == 0) c++;
  61. else if (a[i] == 1) count++;
  62. else if (a[i] == 2) flag++;
  63. }
  64.  
  65. if (s < sum || s == sum + 1) {
  66.  
  67. for (int i = 0; i < c; i++) {
  68. cout << 0 << ' ';
  69. }
  70.  
  71. for (int i = 0; i < flag; i++) {
  72. cout << 2 << ' ';
  73. }
  74.  
  75. for (int i = 0; i < count; i++) {
  76. cout << 1 << ' ';
  77. }
  78. cout << endl;
  79. }
  80. else {
  81. cout << -1 << endl;
  82. }
  83.  
  84. }
  85.  
  86. // Main
  87. int32_t main() {
  88. fast_io;
  89.  
  90. int t;
  91. cin >> t;
  92. while (t--) {
  93. solve();
  94. }
  95.  
  96. return 0;
  97. }
Success #stdin #stdout 0.01s 5316KB
stdin
6
3 2
0 1 2
3 3
0 1 2
3 6
0 1 2
3 4
0 1 2
3 10
0 1 2
5 1000
2 0 1 1 2

stdout
0 2 1 
-1
-1
0 2 1 
-1
-1