CF Round 746 Div2：A. Gamer Hemose

谨以此篇 纪念一下我在CF竞赛通过的第一道题

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 n weapons. The i-th weapon has a damage value ai, and the Agent will face an enemy whose health value is H.

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 0. However, not everything is so easy: the Agent can’t choose the same weapon for 2 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 t (1≤t≤10^5). Description of the test cases follows.

The first line of each test case contains two integers n and H (2≤n≤10^3 ,1≤H≤10^9) — the number of available weapons and the initial health value of the enemy.

The second line of each test case contains n integers a1,a2,…,an (1≤ai≤10^9) — the damage values of the weapons.

It’s guaranteed that the sum of n over all test cases doesn’t exceed 2⋅10^5.

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
inputCopy
3
2 4
3 7
2 6
4 2
3 11
2 1 7
outputCopy
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.

看懂题意后直接用贪心做，同一武器不可以连续用两次
最优解的情况是两个伤害最大的武器按大小顺序先后攻击
问题标签

#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
int t, n, h;
int ans;

int main()
{
	cin.tie(0), ios::sync_with_stdio(false);
	cin >> t;
	while (t--)
	{
		cin >> n >> h;
		vector<int> a(n);//等价于vector<int> a(n,0)
		for (int i = 0; i < n; i++)
		{
			cin >> a[i];
		}
		sort(a.begin(), a.end());
		//		for (auto i : a)
		//		{
		//			cout << i << endl;
		//		}
		int x = a[n - 2], y = a[n - 1];
		int tmp = h % (x + y);
		//		cout << x + y << endl;
		if (tmp == 0)
		{
			ans = h / (x + y) * 2;
		}
		else if (tmp <= y)
		{
			ans = h / (x + y) * 2 + 1;
		}
		else
		{
			ans = h / (x + y) * 2 + 2;
		}
		cout << ans << endl;
	}
	return 0;
}

sum：代码中的vector a(n)等价于vector a(n,0)，而且不能用a.push_back，因为此时a.push_back是把某元素插入到a[n]位置，实际上无法插入（a[n]越界）