Submission #73485878

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long

priority_queue<int,vector<int>,greater<int> > pq;
const int N = 2e5 + 5;
int a[N],b[N];

signed main()
{
	int t;
	cin >> t;
	while(t--)
	{
		while(pq.size()) pq.pop();
		int n,d;
		cin >> n >> d;
		for(int i = 1;i <= n;i++) cin >> a[i];
		for(int i = 1;i <= n;i++) cin >> b[i];
		for(int i = 1;i <= n;i++)
		{
			for(int j = 1;j <= a[i];j++) pq.push(i); 
			for(int j = 1;j <= b[i];j++) pq.pop();
			while(pq.size() && i - pq.top() + 1 > d) pq.pop();
		}
		cout << pq.size() << endl;
	}
	return 0;
}

Submission Info

Judge Result