Sum pair target

#1

my code is not showing any output…
whats wrong in my code,
https://ide.codingblocks.com/s/55556

#2

inside the while loop of k , initialize value of j=0;
So , that for every k , j can move from 0 to n-1 index

#3

you should use 2 pointer approach to solve it in O(n logn) ,
Currently you are solving it in O(n^2) complexity