思路:
先写出暴力做法,再进行双指针优化
代码:
# include<iostream>
# include<algorithm>
# include<cstring>
# include<cstdio>
using namespace std;
const int N = 100010;
int a[N],b[N];
int n,m,x;
int main()
{
cin >> n >> m >> x;
for(int i = 0;i < n;i++)
{
scanf("%d",&a[i]);
}
for(int i = 0;i < m;i++)
{
scanf("%d",&b[i]);
}
for(int i = 0,j = m - 1;i < n;i++)
{
while(j >= 0 && a[i] + b[j] > x)
j--;
if(a[i] + b[j] == x)
printf("%d %d\n",i,j);
}
return 0;
}