{

public static void main (String[] args)

{

int[] array = {1,2,3};

System.out.println(IsExistsPairThatThierSumIsK2(array, 3));

}

/*

static boolean IsExistsPairThatThierSumIsK(int[] array, int k)

{

for (int i = 0; i < array.length; i++)

{

int j = FindLeftmost(array, k - array[i]);

if (j == -1) continue;

if (i != j || (i + 1 < array.length && array[i] == array[i + 1])) return true;

}

return false;

}

static int FindLeftmost(int[] array, int k)

{

int l = 0;

int r = array.length - 1;

while (l < r)

{

int m = l + (r - l) / 2;

if (array[m] >= k) r = m;

else l = m + 1;

}

return array[l] == k ? l : -1;

}

/*

static boolean IsExistsPairThatThierSumIsK2(int[] array, int k)

{

int l = 0;

int r = array.length - 1;

while (l < r)

{

if (array[l] + array[r] == k) return true;

else if (array[l] + array[r] > k) r--;

else l++;

}

return false;

}