今天的题很简单,sort排序加起来之后比较就ok
点个赞谢谢
我就是那个打卡手欠的人,没法打卡了,写个题解权当打卡吧
麻烦点个赞罗
include [HTML_REMOVED]
using namespace std;
void s()
{
int n,x;
cin >> n >> x;
vector[HTML_REMOVED] a(n), b(n);
for (int i = 0; i < n; i )
{
cin>>a[i];
}
for (int i = 0; i < n; i )
{
cin>>b[i];
}
sort(a.begin() , a.end());
sort(b.begin() , b.end() , greater[HTML_REMOVED]());
for (int i = 0; i < n; i ++ )
{
if(a[i] + b[i] > x)
{
cout<<”No”<<endl;
return;
}
}
cout<<”Yes”<<endl;
}
int main()
{
int t;
cin>>t;
while(t–)
{
s();
}
return 0;
}
题解写完了大家再见