程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> 更多編程語言 >> 編程解疑 >> power-超級移動充電器

power-超級移動充電器

編輯:編程解疑
超級移動充電器

Description
While HIT ACM Group finished their contest in Shanghai and is heading back Harbin, their train was delayed due to the heavy snow. Their mobile phones are all running out of battery very quick. Luckily, zb has a super mobile charger that can charge all phones.

There are N people on the train, and the i-th phone has p[i] percentage of power, the super mobile charger can charge at most M percentage of power.

Now zb wants to know, at most how many phones can be charged to full power. (100 percent means full power.)

Input
The first line contains an integer T, meaning the number of the cases (1 <= T <= 50.).

For each test case, the first line contains two integers N, M(1 <= N <= 100,0 <= M <= 10000) , the second line contains N integers pi meaning the percentage of power of the i-th phone.

Output
For each test case, output the answer of the question.

Sample Input

2

3 10

100 99 90

3 1000

0 0 0
Sample Output

2

3

最佳回答:


http://blog.csdn.net/yanghui07216/article/details/50413786

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved