AcWing 800. 数组元素的目标和
原题链接
简单
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
typedef long long ll;
using namespace std;
const int N = int(1e5 + 1);
const int Mod = 998244353;
int a[N], s[N];
int main() {
int n, m, x;
cin >> n >> m >> x;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> s[i];
for (int i = 0, j = m - 1; i < n && j >= 0; ) {
if (a[i] + s[j] > x) j--;
else if (a[i] + s[j] < x) i++;
else {
cout << i << " " << j;
break;
}
}
return 0;
}