30 找找数对

无脑蛮力

#include <iostream>
using namespace::std;
using std::cout;
using std::cin;

int main()
{
	int n,diff,sum;
	cin >> n >> diff;
	int nums1[n],nums2[n];
	sum = 0;
	for(int i=0; i<n; i++)
	{
		cin >> nums1[i];
	}
	for(int i=0; i<n; i++)
	{
		cin >> nums2[i];
	}
	
	for(int i=0; i<n-1; i++)
	{
		for(int j=i+1; j<=n-1; j++)
		{
			if(nums1[i]-nums1[j] <= nums2[i]-nums2[j]+diff)
			{
				sum = sum+1;
			}
		}
	}
	std::cout << sum;
    return 0;
}