#include <bits/stdc++.h>
using namespace std;
#define pf(a) printf("%.9f", a)
#define SZ size()
#define ll long long
#define pb push_back
#define BBC ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
void W2dNHK() {
ll m,n;
cin>>n>>m;
map<ll,ll> p;
ll a[n+11],b[m+11];
for(ll i=1 ; i<=n ; i++ ){
cin>>a[i];
}
for(ll i=1 ; i<=m ; i++ ){
cin>>b[i];
p[b[i]];
}
sort(a+1,a+n+1);
sort(b+1,b+m+1);
ll bol=0;
for(ll i=n ; i>0 ; i-- ){
ll c=a[i];
for(i=m ; i>0 ; i-- ){
if(b[i]<=c && p[b[i]]>0){
p[b[i]]--;
c-=b[i];
}
}
if(c!=0){
bol=1;
break;
}
}
if(bol==1){
cout<<"NO"<<endl;
}
else{
cout<<"YES"<<endl;
}
}
int main() {
BBC
ll tc = 1;
cin >> tc;
while (tc--) {
W2dNHK();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |