大玉米红温记

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,sum;
struct node{
    int num,id;
}a[40];
bool quick_sort(node x,node y){
    return x.num<y.num;
}
signed main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i].num,sum+=a[i].num,a[i].id=i;
    sort(a+1,a+n+1,quick_sort);
    if(sum<a[n].num*2)
        cout<<"impossible";
    else
        for(int i=n;i>=1;i--)
            cout<<a[i].id<<" ";
    return 0;
}