题目描述
blablabla
算法
(暴力二分) $O(nlgn)$
用的不是双指针,效果也一般,没想到也能过- -...
C++ 代码
#include<iostream>
using namespace std;
const int N = 1e5 + 10;
int n, m, x;
int a[N], b[N];
int main()
{
int i1, j1;
cin >> n >> m >> x;
for(int i = 0 ; i < n ; i ++) cin >> a[i];
for(int i = 0 ; i < m ; i ++) cin >> b[i];
for(int i = 0, j = 0 ; i < n ; i ++)
{
i1 = i;
int tmp = x - a[i];
int l = 0, r = m - 1;
while(l < r)
{
int mid = l + r >> 1;
if(b[mid] >= tmp) r = mid;
else l = mid + 1;
}
j = l;
if(b[j] == tmp)
{
j1 = j;
break;
}
j = 0;
}
cout << i1 << ' ' << j1;
return 0;
}