#include<cstdio>
void getSumKPair(int *arr, int n, int k, int &a, int &b)
{
int nLow, nHigh;
long long product;
nLow = 0, nHigh = n-1;
a = b = -1, product = 0x7fffffff;
int flag=0;
while(nLow < nHigh)
{
if(arr[nLow] + arr[nHigh] == k )
{
if(!flag){
a = nLow;
b = nHigh;
product = arr[a] * arr[b];
++nLow, --nHigh;
}
else if(arr[nLow] + arr[nHigh] < k)
......
阅读全文