IOI 11 Hottest

#include <iostream>

using namespace std;

int main()
{
    int n,k;
    cin>>n>>k;
    int t[n];
    for (int i=0;i<n;i++) cin>>t[i];
    int max=0, sum = 0;
    for (int i=0;i<k;i++) sum=sum+t[i];
    if ( max < sum ) max=sum;
    for (int i=k;i<n;i++)
    {
        sum += t[i];
        sum -= t[i - k];
        if ( max < sum ) max=sum;
    }
    cout<<max<<endl;
    return 0;
}