Codeforces Round #746 (Div. 2) A. Gamer Hemose

题目链接：Problem - 1592A - Codeforces

One day, Ahmed_Hossam went to Hemose and said "Let's solve a gym contest!". Hemose didn't want to do that, as he was playing Valorant, so he came up with a problem and told it to Ahmed to distract him. Sadly, Ahmed can't solve it... Could you help him?

There is an Agent in Valorant, and he has nn weapons. The ii-th weapon has a damage value aiai, and the Agent will face an enemy whose health value is HH.

The Agent will perform one or more moves until the enemy dies.

In one move, he will choose a weapon and decrease the enemy's health by its damage value. The enemy will die when his health will become less than or equal to 00. However, not everything is so easy: the Agent can't choose the same weapon for 22 times in a row.

What is the minimum number of times that the Agent will need to use the weapons to kill the enemy?

Input

Each test contains multiple test cases. The first line contains the number of test cases tt (1≤t≤105)(1≤t≤105). Description of the test cases follows.

The first line of each test case contains two integers nn and HH (2≤n≤103,1≤H≤109)(2≤n≤103,1≤H≤109) — the number of available weapons and the initial health value of the enemy.

The second line of each test case contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤109)(1≤ai≤109) — the damage values of the weapons.

It's guaranteed that the sum of nn over all test cases doesn't exceed 2⋅1052⋅105.

Output

For each test case, print a single integer — the minimum number of times that the Agent will have to use the weapons to kill the enemy.

Example

input

Copy

3
2 4
3 7
2 6
4 2
3 11
2 1 7

output

Copy

1
2
3

Note

In the first test case, the Agent can use the second weapon, making health value of the enemy equal to 4−7=−3. −3≤0, so the enemy is dead, and using weapon 1 time was enough.

In the second test case, the Agent can use the first weapon first, and then the second one. After this, the health of enemy will drop to 6−4−2=0, meaning he would be killed after using weapons 2 times.

In the third test case, the Agent can use the weapons in order (third, first, third), decreasing the health value of enemy to 11−7−2−7=−5 after using the weapons 3 times. Note that we can't kill the enemy by using the third weapon twice, as even though 11−7−7<0, it's not allowed to use the same weapon twice in a row.

题意：有n把武器，没把武器有个伤害，一次只能使用一把武器来造成伤害，不能连续使用同一把武器，问需要几步才能战胜

思路：一直使用伤害最高的两把去攻击，设h为血量，a为最高伤害，b为第二高伤害；ans为次数；

cnt为余数

ans = h / (a + b);

cnt = h % (a + b);

if(cnt > 0 && cnt <= a){

ans++;

}else if(cnt > a){

ans+= 2;
}

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;

int arr[1005];
bool cmp(int a, int b){
	return a > b;
}

int main(){
	int t;
	int n, h;
	cin >> t;
	while(t--){
		cin >> n >> h;
		for(int i = 0; i < n; i++){
			cin >> arr[i];
		}
		sort(arr, arr + n, cmp);
		int a = arr[0];
		int b = arr[1];
		int ans = h / (a + b) * 2;
		int cnt = h % (a + b);
		if(cnt > a){
			ans += 2;
		}else if(cnt > 0){
			ans ++;
		}
		cout << ans << endl;
	}
	return 0;
}