Just Smaller Number: Hackerearth Problem and Solution in java

Just Smaller Number: Hackerearth Problem
Statement:

Given an array $A$ of length $N$ and a number $K$, find the greatest number in the array $A$ that is smaller than $K$.

Input:
First line contains two space separated integer $N,(1\le N\le {10}^5)$ and $Q,(1\le Q\le {10}^5)$, number of elements in the array $A$, and number of queries.
Second line contains $N$ space separated integers $A_i,(1\le A_i\le {10}^9)$, elements of the array $A$.
Next $Q$ lines contains one integer $K,(1\le K\le {10}^9)$ each.

Output:
For each query, print the number of the greatest number in the array $A$ that smaller than $K$.

SAMPLE INPUT

 

5 3
3 5 7 2 3
10
7
6

SAMPLE OUTPUT

 

7
5
5

Explanation

The greatest number that is smaller than $10$ is $7$.
The greatest number that is smaller than $7$ is $5$.
The greatest number that is smaller than $6$ is $5$.

SOLUTION IN JAVA:

import java.util.*;


class TestClass {
    public static void main(String args[] ) throws Exception {
       
        Scanner s = new Scanner(System.in);
        int N = s.nextInt();
        int t = s.nextInt();
        int arr[] = new int[N];

        for (int i = 0; i < N; i++) {
           // System.out.println("hello world");
           arr[i]=s.nextInt();
        }
        for(int j=0;j<t;j++){
            int var=s.nextInt();
            int min=arr[0];
             for(int k=0;k<N;k++){
               if(arr[k]<var){
                  int diff = var-arr[k];
                   if(diff<min)
                     min=diff;
                } 
             }
           System.out.println(var-min);
        }

    }

}