Help me in solving PROC18A problem

help
,
1

My issue

t=int(input())
for i in range(t):
n,k=map(int,input().split())
a=list(map(int,input().split()))
l1=
for j in range(0,n-k-1):
l=
sum1=0
l=a[j:j+k]
for m in l:
sum1=sum1+m
l1.append(sum1)
print(max(l1))

My code

# cook your dish here
t=int(input())
for i in range(t):
    n,k=map(int,input().split())
    a=list(map(int,input().split()))
    l1=[]
    for j in range(0,n-k-1):
        l=[]
        sum1=0
        l=a[j:j+k]
        for m in l:
            sum1=sum1+m
            l1.append(sum1)
    print(max(l1))

Problem Link: The Great Run Practice Coding Problem - CodeChef

2

@khushisahu0108
can be solved by sliding window
here refer my c++ code for better understanding of the logic

#include <iostream>
using namespace std;

int main() {
	// your code goes here
	int t;
	cin>>t;
	while(t--)
	{
	    int n,k;
	    cin>>n>>k;
	    int a[n];
	    for(int i=0;i<n;i++)
	    {
	        cin>>a[i];
	    }
	    int sm=0;
	    int mx=0;
	    for(int i=0;i<k;i++)
	    {
	        sm+=a[i];
	    }
	    mx=max(mx,sm);
	    for(int i=k;i<n;i++)
	    {
	        sm-=a[i-k];
	        sm+=a[i];
	        mx=max(mx,sm);
	    }
	    cout<<mx<<endl;
	}
	return 0;
}