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: n1,k1=input().split()
n,k=int(n1),int(k1)
l=list(map(int,input().strip().split()))
curr_sum=0
for x in range(k):
    curr_sum=curr_sum+l[x]
max_sum=curr_sum
i=0
j=k
while i<len(l)-k:
    curr_sum=curr_sum-l[i]+l[j]
    max_sum=max(max_sum,curr_sum)
    i+=1
    j+=1
print(max_sum), In this Programming Language: Python, Now tell me if this Code is compilable or not?