双指针算法
时间复杂度O(n+m)
参考文献
C++ 代码
#include<iostream>
using namespace std;
const int N = 100010;
int a[N], b[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 >> b[i];
}
int p = n - 1, q = 0;
while(p >= 0 || q < m)
{
if(a[p] + b[q] > x) p -- ;
else if(a[p] + b[q] < x ) q ++ ;
else
{
cout << p <<" "<< q;
break;
}
}
return 0;
}