Language: C++

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <stdint.h>
#include <queue>
#include <bitset>
#include <iomanip>
#include <set>
#include <map>

using namespace std;

#define PI (3.14159265358979323846)
#define INF (2147483647)
#define INF_LL (9223372036854775807)
#define DIV_NUM (1000000007)
typedef long long ll;

// 配列初期化テンプレ
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T& val) {
	std::fill((T*)array, (T*)(array + N), val);
}


int main() {

	ll N, M, K;
	cin >> N >> M >> K;
	
	vector<ll> A(N+1);
	for (ll i = 0; i < N; i++) {
		ll tmp;
		cin >> tmp;
		A[i+1] = A[i] + tmp;
	}

	vector<ll> B(M+1);
	for (ll i = 0; i < M; i++) {
		ll tmp;
		cin >> tmp;
		B[i + 1] = B[i] + tmp;
	}

	ll ans = 0;
	for (ll i = 0; i < A.size(); i++) {
		ll rest = K - A[i];
		if (rest < 0) break;
		vector<ll>::iterator ite = lower_bound(B.begin(), B.end(), rest);
		ll Bnum = 0;
		if (ite == B.end()) Bnum = B.size();
		else Bnum = max(0, (ite - B.begin()) - 1);
		ll total_num = i + Bnum;
		ans = max(ans, total_num);
	}

	cout << ans << endl;

	return 0;

}


Compiler output:
a.cc: In function 'int main()':
a.cc:54:32: error: no matching function for call to 'max(int, __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >::difference_type)'
   54 |                 else Bnum = max(0, (ite - B.begin()) - 1);
      |                             ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/string:51,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
a.cc:54:32: note:   deduced conflicting types for parameter 'const _Tp' ('int' and '__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >::difference_type' {aka 'long int'})
   54 |                 else Bnum = max(0, (ite - B.begin()) - 1);
      |                             ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61,
                 from a.cc:5:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5706 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5716 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note:   template argument deduction/substitution failed:
a.cc:54:32: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   54 |                 else Bnum = max(0, (ite - B.begin()) - 1);
      |                             ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~