Education（贪心+枚举+模拟）

Polycarp is wondering about buying a new computer, which costs c tugriks. To do this, he wants to get a job as a programmer in a big company.
There are n positions in Polycarp’s company, numbered starting from one. An employee in position i earns a[i] tugriks every day. The higher the position number, the more tugriks the employee receives. Initially, Polycarp gets a position with the number 1 and has 0 tugriks.
Each day Polycarp can do one of two things:

1、If Polycarp is in the position of x, then he can earn a[x] tugriks.
2、If Polycarp is in the position of x (x<n) and has at least b[x] tugriks, then he can spend b[x] tugriks on an online course and move to the position x+1.

For example, if n=4, c=15, a=[1,3,10,11], b=[1,2,7], then Polycarp can act like this:

On the first day, Polycarp is in the 1-st position and earns 1 tugrik. Now he has 1 tugrik;
On the second day, Polycarp is in the 1-st position and move to the 2-nd position. Now he has 0 tugriks;
On the third day, Polycarp is in the 2-nd position and earns 3 tugriks. Now he has 3 tugriks;
On the fourth day, Polycarp is in the 2-nd position and is transferred to the 3-rd position. Now he has 1 tugriks;
On the fifth day, Polycarp is in the 3-rd position and earns 10 tugriks. Now he has 11 tugriks;
On the sixth day, Polycarp is in the 3-rd position and earns 10 tugriks. Now he has 21 tugriks;
Six days later, Polycarp can buy himself a new computer.
Find the minimum number of days after which Polycarp will be able to buy himself a new computer.

Input

The first line contains a single integer t (1≤t≤104). Then t test cases follow.

The first line of each test case contains two integers n and c (2≤n≤2⋅105, 1≤c≤109) — the number of positions in the company and the cost of a new computer.

The second line of each test case contains n integers a1≤a2≤…≤an (1≤ai≤109).

The third line of each test case contains n−1 integer b1,b2,…,bn−1 (1≤bi≤109).

It is guaranteed that the sum of n over all test cases does not exceed 2⋅105.

Output

For each test case, output the minimum number of days after which Polycarp will be able to buy a new computer.

Example Input

3
4 15
1 3 10 11
1 2 7
4 100
1 5 10 50
3 14 12
2 1000000000
1 1
1

Output

6
13
1000000000

题意：第一行输入一个t，表示t组测试样例；第二行n，c。表示有n个职位，买电脑需要花费c钱，第三行n个数，表示在每个职位上赚的钱，第四行n-1个数，表示，从第i个职位升职到第i+1个职位需要花费b[i]钱。

有两种操作，第一：在第i个职位上一天赚a[i]个钱，第二：如果当前剩的钱>=b[i]，则花费b[i]个钱升职到i+1个职位，花费一天。

问：能够买到电脑的最少天数。

代码详解：

#include<stdio.h>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const int maxn=2*1e5+10;
ll a[maxn],b[maxn];
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		ll n,c,i,j,k;
		scanf("%lld%lld",&n,&c);
		for(i=1; i<=n; i++)
			scanf("%lld",&a[i]);
		for(i=1; i<n; i++)
			scanf("%lld",&b[i]);
		ll minn=inf;
		ll smoney=0,sday=0;
		ll zday;
		for(i=1; i<=n; i++)
		{
			zday=(c-smoney)/a[i];//zday是到该职位买电脑需要的天数
			if(((c-smoney)%a[i])!=0)//smoney是从职位1到职位i升完职剩下的钱
				zday++;//判断能不能整除，不能需要多加一天
			zday+=sday;//sday是1~i-1升职需要的天数
			if(zday<minn)
				minn=zday;
			//前面已经判断完在i职位买到电脑花费的天数；
			//下面，要升职到i+1职位，k是计算升职花费的时间
			k=0;
			if(smoney<b[i])
			{
				k=(b[i]-smoney)/a[i];
				if(((b[i]-smoney)%a[i])!=0)
					k++;
			}
			sday+=k;
			sday++;//升职需要一天
			smoney+=(k*a[i])-b[i];// smoney计算升完职还剩多少钱
			//即，赚的钱-升完职花的钱就是剩的钱
		}
		printf("%lld\n",minn);
	}
	return 0;
}