-
Notifications
You must be signed in to change notification settings - Fork 0
/
C.cpp
54 lines (41 loc) · 1000 Bytes
/
C.cpp
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
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
#define endl "\n";
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
ll const inf = 1e18;
ll const maxn = 1e6+5;
ll const mod = 998244353;
// code begins here
int main(){
fast;
ll n,m,k;
cin>>n>>m>>k;
vector<ll> arr(n), brr(m);
for(auto &u: arr)
cin>>u;
for(auto &u: brr)
cin>>u;
for(ll i=1;i<n;i++)
arr[i]+=arr[i-1];
for(ll j=1;j<m;j++)
brr[j] += brr[j-1];
ll ans =0;
for(ll i=0;i<n;i++){
if(arr[i]>k)
break;
ll ans1 = i+1;
auto it = upper_bound(brr.begin(), brr.end(), k - arr[i]) - brr.begin();
ans1 += it;
ans = max(ans, ans1);
}
for(ll i=0;i<m;i++){
if(brr[i]>k)
break;
ans = max(ans, i+1);
}
cout<<ans<<endl;
return 0;
}