For this Question: Given an array of integers A and a number K, find maximum sum of a subarray of size K.The first line of input contains two integers N and K, denoting the number of elements in the array and the subarray size respectively.
The next line contains N integers denoting the elements of the array respectively.

1 <= K <= N <= 200000
-200000 <= A[i] <= 200000Print a single integer denoting the maximum sum of subarray of size K.Sample Input:
4 2
-1 5 2 -3

Sample Output:
7

Explanation:
Three subarrays of size 2, their sum are 4, 7, -1, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) {

		Scanner sc=new Scanner(System.in);
        String s[]=sc.nextLine().split(" ");
        int n=Integer.parseInt(s[0]);
        int k=Integer.parseInt(s[1]);
        s=sc.nextLine().split(" ");
        int ar[]=new int[n];
        for(int i=0;i<n;i++){
            ar[i]=Integer.parseInt(s[i]);
        }
        int max=0;
        for(int i=0;i<=n-k;i++){
            int t=0;
            for(int j=0;j<k;j++){
                t+=ar[i+j];
            }
            if(t>max)
            max=t;
        }
        System.out.println(max);
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?