1178A A. Prime Minister

A. Prime Minister
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Alice is the leader of the State Refactoring Party, and she is about to become the prime minister.

The elections have just taken place. There are n parties, numbered from 1 to n. The i-th party has received ai seats in the parliament.

Alice’s party has number 1. In order to become the prime minister, she needs to build a coalition, consisting of her party and possibly some other parties. There are two conditions she needs to fulfil:

The total number of seats of all parties in the coalition must be a strict majority of all the seats, i.e. it must have strictly more than half of the seats. For example, if the parliament has 200 (or 201) seats, then the majority is 101 or more seats.
Alice’s party must have at least 2 times more seats than any other party in the coalition. For example, to invite a party with 50 seats, Alice’s party must have at least 100 seats.
For example, if n=4 and a=[51,25,99,25] (note that Alice’a party has 51 seats), then the following set [a1=51,a2=25,a4=25] can create a coalition since both conditions will be satisfied. However, the following sets will not create a coalition:

[a2=25,a3=99,a4=25] since Alice’s party is not there;
[a1=51,a2=25] since coalition should have a strict majority;
[a1=51,a2=25,a3=99] since Alice’s party should have at least 2 times more seats than any other party in the coalition.
Alice does not have to minimise the number of parties in a coalition. If she wants, she can invite as many parties as she wants (as long as the conditions are satisfied). If Alice’s party has enough people to create a coalition on her own, she can invite no parties.

Note that Alice can either invite a party as a whole or not at all. It is not possible to invite only some of the deputies (seats) from another party. In other words, if Alice invites a party, she invites all its deputies.

Find and print any suitable coalition.

Input
The first line contains a single integer n (2≤n≤100) — the number of parties.

The second line contains n space separated integers a1,a2,…,an (1≤ai≤100) — the number of seats the i-th party has.

Output
If no coalition satisfying both conditions is possible, output a single line with an integer 0.

Otherwise, suppose there are k (1≤k≤n) parties in the coalition (Alice does not have to minimise the number of parties in a coalition), and their indices are c1,c2,…,ck (1≤ci≤n). Output two lines, first containing the integer k, and the second the space-separated indices c1,c2,…,ck.

You may print the parties in any order. Alice’s party (number 1) must be on that list. If there are multiple solutions, you may print any of them.

Examples
input
3
100 50 50
output
2
1 2
input
3
80 60 60
output
0
input
2
6 5
output
1
1
input
4
51 25 99 25
output
3
1 2 4
Note
In the first example, Alice picks the second party. Note that she can also pick the third party or both of them. However, she cannot become prime minister without any of them, because 100 is not a strict majority out of 200.

In the second example, there is no way of building a majority, as both other parties are too large to become a coalition partner.

In the third example, Alice already has the majority.

The fourth example is described in the problem statement.

题意： Alice参加竞选，她的政党数有a1人，要拉拢不超过a1/2的政党数壮大自己的人数，问最终Alice拉拢的人数能否超过剩余的总人数，有则输出总的政党数及对应的数组下标。
思路： 先记录总人数，再模拟一 遍。

#include <iostream>
#include <algorithm>
#include <queue> 
using namespace std;
int main() {
	queue<int> q;
	int n, a[105], sum = 0;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &a[i]);
		if (i > 0) sum += a[i];
	}
	int num = a[0] / 2; //先记录Alice政党数的一半 
	for (int i = 1; i < n; i++) {
		if (a[i] <= num) { //该数大于num时，加入Alice的政党队伍 
			q.push(i + 1);
			a[0] += a[i];
			sum -= a[i];
		}
	}
	if (a[0] <= sum) { // 此时Alice的人数小于剩余总人数时，输出0 
		printf("0\n");
	} else {
		if (q.size() == 0) { // 如果大于但没加入额外的，输出1  1 
			printf("1\n1\n");
		} else {
			printf("%d\n", q.size() + 1);
			printf("1");
			while (!q.empty()) {
				printf(" %d", q.front());
				q.pop();
			}	 
		}
	}
	return 0;
}