P1046 [noip2005 popularity group t1] Taotao picking apples

【 Title source 】
https://www.luogu.com.cn/problem/P1046
https://www.acwing.com/problem/content/423/

【 Title Description 】
There is an apple tree in the Tao Tao's yard , Every autumn the trees will bear 10 An apple . When the apple is ripe , Tao Tao would run to pick apples . Tao Tao has a 30 Centimeter high bench , When she can't pick the apple directly by hand , Will step on the bench and try again .
Now we know 10 The height of an apple to the ground , And the maximum height that can be reached when the handle of pottery is extended , Please help Tao Tao calculate the number of apples she can pick . Suppose she ran into an apple , The apple will fall .

【 Input format 】
The input consists of two lines of data . The first line contains 10 individual 100 To 200 Between （ Include 100 and 200 ） The integer of （ In centimeters ） respectively 10 The height of an apple to the ground , Two adjacent integers are separated by a space . The second line only includes one 100 To 120 Between （ contain 100 and 120 ） The integer of （ In centimeters ）, It means the maximum height that can be reached when the handle of pottery is extended .

【 Output format 】
The output includes a line , This line contains only one integer , The number of apples that pottery can pick .

【 Algorithm code 】

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

int main() {
	int a[10];
	for (int i=0; i<10; i++) cin>>a[i];

	int height;
	cin>>height;
	height+=30;

	int ans=0;
	for(int i=0; i<10; i++) {
		if(a[i]<=height) ans++;
	}
	cout<<ans<<endl;

	return 0;
}


/*
in:
100 200 150 140 129 134 167 198 200 111
110

out:
5
*/

【 reference 】
https://www.acwing.com/solution/content/3095/