1178A - Prime Minister

#include <iostream>

#include<vector>

#include<string>

#include<math.h>

#include<set>

#include<map>

#include<list>

#include<stack>

#include<queue>

#include <fstream>

#include<iterator>

#include<algorithm>

#include <iomanip>      // std::setprecision

/* ==================================================

  |                                                  |

  |    Author: *** S. M. Sabiul Hajjaj Sabit ***     |

  |       Last Edit:  May,14,2019                    |

   ================================================== */

///***global declaration***///

#define all(arr) arr.begin(),arr.end()

#define pb push_back

#define lb lower_bound

#define up upper_bound

#define sz(x) x.size()

#define min3(a,b,c)  min(min(a,b),c)

#define max3(a,b,c)  max(max(a,b),c)

#define lli long long int

using namespace std;

int j,n,m,sum=0,ans=0;

template <typename T>long long int power(T a, T b)

{

    long long int pow=1;

    for(int i=0; i<b; i++)

        pow *= a;

    return pow;

}

/**** asc sort vector of pair basis fd 2nd element******/

bool sortbysec(const pair<int,int> &a,const pair<int,int> &b)

{

    return (a.second < b.second);

}

//sort(vect.begin(), vect.end(),sortbysec);

/////*********Write Code From Here*********///

int main()

{

    int n;

    vector<int>arr;

    cin>>n;

    int total=0;

    for(int i=0; i<n; i++)

    {

        int t;

        cin>>t;

        total+=t;

        arr.pb(t);

    }

    int mid = total/2;

    vector<int>a;

    int count=0;

    for(int i=1; i<n; i++)

    {

        if(arr[0]>=arr[i]*2)

        {

            a.pb(i);

            count+=arr[i];

        }

    }

    if(count+arr[0]<=mid)

    {

        cout<<0<<endl;

    }

    else

    {

        cout<<a.size()+1<<endl;

        cout<<1<<" ";

        for(int i=0; i<sz(a); i++)

        {

            cout<<a[i]+1<<" ";

        }

    }

}