Codeforces Global Round 3 B. Born This Way

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 #define ll long long
 4 #define pb push_back
 5 const int maxn =2e5+10;
 6 int a[maxn];
 7 int b[maxn];
 8 
 9 int main()
10 {
11     ios::sync_with_stdio(false);
12     cin.tie(0);
13     int n,m,ta,tb,k;
14     cin>>n>>m>>ta>>tb>>k;
15     for(int i=1;i<=n;i++)
16     {
17         cin>>a[i];
18         a[i]+=ta;
19     }
20     for(int i=1;i<=m;i++)
21     {
22         cin>>b[i];
23     }
24     int ans=0;
25     for(int i=0;i<=k;i++) //a删去多少个
26     {
27         if(i>=n)
28         {
29             cout<<-1<<‘\n‘;
30             return 0;
31         }
32         int x=lower_bound(b+1,b+1+m,a[i+1])-b;
33         if(x+k-i>m)
34         {
35             cout<<-1<<‘\n‘;
36             return 0;
37         }
38         ans=max(ans,b[x+k-i]+tb);
39     }
40     cout<<ans<<‘\n‘;
41 
42 
43 
44 }