//idea: use appropriate data structure such as hash table
public class P1{

static void fun(int[] arr, int N){
    Map<Integer,Integer> map = 
                 new HashMap<Integer,Integer>(); 
    for(int i=0;i<arr.length;i++){
          int x = N - arr[i];
          if(map.get(arr[i]) != null ){ 
                 System.out.println(x + " + " + arr[i] + " =" + N);
                 return;
          }
           map.put(x,x); 
    }
    System.out.println("not found");
}
}