武汉科技大学ACM：1005: Soapbear and Honey

Problem Description

Soapbear is the mascot of WHUACM team. Like other bears, Soapbear loves honey very much, so he decides to get some honeycombs for honey. There are N honeycombs hanging on some trees, numbered from 1 to N, and the height of honeycomb i is Hi. The height Soapbear can reach the is Hx, so he wonders how many honeycombs he can get at most.

Input

There are multiple test cases in the input file. There first line of the input is an integer T indicates the number of the test cases. Each test case starts with a line containing two integer, N and Hx (0 < N <= 200000, 0 < Hx < 200). Next, there is a line of N integers specifying Hi (1 <= i <= N, 0 < Hi < 200).

Output

For each test case, output a line with an integer indicates the number of honeycombs Soapbear can get at most.

Sample Input

2
2 180
170 190
3 180
180 170 190

Sample Output

1
2

HINT

Note：Input/Output of scanf/printf is faster than cin/cout, so if a problem has huge input data, use cin will probably get a Time Limit Exceeded.

#include<stdio.h>
#define N 200001
int main()
{
    int n,m,Hx=0;
    int a[N];
    scanf("%d",&n);
    while(n--)
    {
        int result=0;
        for(int i=0;i<N;i++)
            a[i]=0;
        scanf("%d",&m);
        scanf("%d",&Hx);
        for(int j=0;j<m;j++)
        {
            scanf("%d",&a[j]);
        }
        for(int k=0;k<m;k++)
        {
            if(a[k]<=Hx)
                result++;
        }
        printf("%d
",result);
    }
    return 1;
}