Maximum Sum Subarray With At Least K Elements

medium
Question Solve Solutions 
1. You are given an array(arr) of integers and a number k.
2. You have to find maximum subarray sum in the given array.
3. The subarray must have at least k elements.

Input Format

A number N a1 a2.. N integers A number K

Output Format

A number representing maximum subarray sum with subarray having at least K elements.

Constraints

1 <= N <= 10^5
1 <= arr[i] <= 10^5
1 <= K <= N

Example

Input
3
1
2
3
2
Output
6
Previous
K Concatenation
Next
Maximum Sum Of Three Non-overlapping Subarrays

Related Questions

easy Super Ugly Number easy Burst Balloons easy Cherry Pickup easy Regular Expression Matching easy Rod Cutting easy Russian Doll Envelopes easy Scramble String easy Temple Offerings easy Word Break easy Optimal Strategy For A Game easy Longest Bitonic Subsequence easy Count Palindromic Subsequences easy Longest Common Subsequence easy Longest Common Substring easy Longest Increasing Subsequence easy Distinct Transformations