ACM刷题之ZOJ————Demacia of the Ancients

Demacia of the Ancients

---

Time Limit: 2 Seconds       Memory Limit: 65536 KB

---

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

3
5
7986 6984 6645 6200 6150
5
7401 7377 6900 6000 4300
3
800 600 200

Sample Output

5
3
0

水题 判断是否比6000大即可

下面是ac代码

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<string>
#include<iostream>
using namespace std;
#define MID(x,y) ((x+y)>>1)
#define CLR(arr,val) memset(arr,val,sizeof(arr))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int N=2e5+7;
int a[11000]; 
int main()
{
	//freopen("f:/input.txt", "r", stdin);
	int zu,i,j,k,cnt;
	scanf("%d",&zu);
	while(zu--)
	{
		scanf("%d",&j);
		cnt=0;
		for(i=0;i<j;i++)
		{
			scanf("%d",&k);
			if(k>6000)
				++cnt;
		}
		printf("%d\n",cnt);
	}
}