Submission #14767064

---

Source Code Expand

/* 	* In the name of GOD 
 	* Thanks God */
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define int long long
const int N = 400000;
int a[N], b[N], psa[N], psb[N], it1 = 0, it2 = 0;

int32_t main(){
	int n, m, k;
	cin >> n >> m >> k;
	for (int i = 0; i < N; i++){
		a[i] = 10000000000000000ll;
		b[i] = 10000000000000000ll;
		psa[i] = 10000000000000000ll;
		psb[i] = 10000000000000000ll;
	}
	psa[0] = 0;
	psb[0] = 0;
	for (int i = 0; i < n; i++){
		cin >> a[i];
		psa[i + 1] = (i == 0 ? a[0] : psa[i] + a[i]);
	}
	for (int i = 0; i < m; i++){
		cin >> b[i];
		psb[i + 1] = (i == 0 ? b[0] : psb[i] + b[i]);
	}
	int ans = 0;
	for (int i = 0; i <= n; i++){
		if (k < psa[i])
			continue;
		int x = k - psa[i];
//		for (int i = 0; i <= m + 1; i++){
//			cout << psb[i] << ' ';
//		}
//		cout << endl;
		int y = upper_bound(psb, psb + N, x) - psb - 1;
//		cout << y << endl;
		ans = max(ans, y + i);
	}
	cout << ans << endl;
}

Submission Info

Judge Result