-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path11780.cpp
98 lines (56 loc) · 1.21 KB
/
11780.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int party[n];
long long int sum = 0;
for(int i=0; i<n; i++)
{
cin >> party[i];
sum += party[i];
}
long long int majo = (sum / 2);
// cout << majo << endl;
if(party[0] > majo)
{
// cout << "as" << endl;
cout << 1 << endl;
cout << 1 << endl;
return 0;
}
else
{
vector<int>v;
int count = 0;
int no_1 = party[0];
count++;
v.push_back(1);
for(int i=1; i<n; i++)
{
if(no_1 > majo)
{
break;
}
if(no_1>=(party[i]*2))
{
count++;
v.push_back(i+1);
no_1 += party[i];
}
}
if(no_1 < majo)
{
cout << 0 << endl;
return 0;
}
else
{
cout << count << endl;
for(int j=0; j<v.size(); j++)
cout << v[j] << " ";
}
}
return 0;
}