H

Description

There is a popular multiplayer online battle arena game called Demacia of the Ancients. There are lots of professional teams playing this game. A team will be approved as Level K if there are exact K team members whose match making ranking (MMR) is strictly greater than 6000.

You are given a list of teams. Please calculate the level of each team.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains an integer N (1 <= N <= 10) indicating the number of team members.

The second line contains N integers representing the MMR of each team member. All MMRs are non-negative integers less than or equal to 9999.

Output

For each test case, output the level of the given team.

Sample Input

357986 6984 6645 6200 615057401 7377 6900 6000 43003800 600 200

Sample Output

530

思路：

输入几组测试数据，统计其中大于6000的数的个数。

思路：

运用数组存放数据，然后运用for循环来查找其中大于6000的数的个数。

心得:

水题，仔细读懂题即可！

代码：

#include<bits/stdc++.h>using namespace std;int MMR[15];int main(){    int t,n,i,j;    int sum;    cin>>t;    while(t--)    {        cin>>n;        for(i=0;i<n;i++)        cin>>MMR[i];        sum=0;        for(i=0;i<n;i++)        {            if(MMR[i]>6000)            sum++;        }        cout<<sum<<endl;    }    return 0;}