Submission #8514604

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep(i, j) for (int i = 0; i < j; i++)
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<pii> vpii;

int main() {

    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.precision(10);
    cout << fixed;

    ll n, x;
    cin >> n >> x;
    vll a(n);
    rep(i, n) cin >> a[i];

    ll sum = 0;
    rep(i, n) sum += a[i];

    vll ans;
    int l = 0, r = n - 1;
    while (r - l > 0) {
        if (sum < x) break;
        if (a[l] > a[r]) {
            ans.push_back(r);
            sum -= a[r];
            r--;
        } else {
            ans.push_back(l + 1);
            sum -= a[l];
            l++;
        }
    }

    if (ans.size() != n - 1) {
        cout << "Impossible" << endl;
    } else {
        cout << "Possible" << endl;
        rep(i, n - 1) {
            cout << ans[i] << endl;
        }
    }

    return 0;
}

Submission Info

Judge Result