-
a 升序
-
b 降序
-
对应位置元素求和判断
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 50;
int a[N], b[N];
int n, x;
int main()
{
int T;
cin >> T;
while(T--)
{
cin >> n >> x;
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++) cin >> b[i];
sort(a, a + n);//测试用例不严谨,a不排序也能过,hh
sort(b, b + n, greater<int>());
int flag = 1;
for(int i = 0; i < n; i++)
{
if(a[i] + b[i] > x)
{
flag = 0;
break;
}
}
if(flag == 1) cout << "Yes" << endl;
else cout <<"No" << endl;
}
return 0;
}
证明,贪心题靠的就是直觉,
哇丢!!!太有石粒了啊!!!
贪心靠的就是直角!哈哈哈哈