1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
struct PairHash {inline std::size_t operator()(const std::pair<int,int> & v) const {return v.first*31+v.second;}};
#define MAX_N 101010
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vi vector<int>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define umll unordered_map<ll,ll>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
ll __gcd(ll x, ll y) { return !y ? x : __gcd(y, x % y); }
using namespace std;
string solve(vpll& A, vpll& B) {
sort(all(A));
sort(all(B));
ll n = A.size(), m = B.size();
priority_queue<ll> a, b;
ll i = 0, j = 0;
while(i < n and j < m) {
ll ah = A[i].first;
while(j < m and B[j].first < ah) {
b.push(B[j++].second);
}
queue<ll> tmp;
while(!a.empty() and !b.empty()) {
if(b.top() >= a.top()) {
b.pop(); a.pop();
} else {
tmp.push(a.top());
a.pop();
}
}
while(!b.empty()) b.pop();
while(!tmp.empty()) {
a.push(tmp.front());
tmp.pop();
}
while(i < n and ah == A[i].first) {
a.push(A[i++].second);
}
}
while(j < m) b.push(B[j++].second);
while(!a.empty() and !b.empty() and b.top() >= a.top()) {
a.pop();
b.pop();
}
return a.empty() ? "Yes" : "No";
}
int main() {
ios_base::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(0);
ll tc = 1;
for(ll i = 1; i <= tc; i++) {
ll n, m;
cin>>n>>m;
vpll A(n), B(m);
for(ll j = 0; j < n; j++) cin>>A[j].first;
for(ll j = 0; j < n; j++) cin>>A[j].second;
for(ll j = 0; j < m; j++) cin>>B[j].first;
for(ll j = 0; j < m; j++) cin>>B[j].second;
cout<<solve(A,B)<<endl;
}
return 0;
}
|
