A higher resolution is required to access the IDE
- 208
Learning Opportunities
This puzzle can be solved using the following concepts. Practice using these concepts and improve your skills.
Statement
Goal
Story:The Grand Festival has arrived at the Shire! Merry and Pippin decide to participate in its competitions. There are a variety of competitions, like archery, sword fighting, hunting, riding, etc.
However, they realize that after playing some tournaments consecutively, they need to rest a day. They gather information about the prize money of each competition. 1 competition is held every day.
Merry and Pippin decide they will try to get the maximum prize money. For this, they ask Gandalf for help. Help Gandalf choose which tournaments They should play.
-------------------------------------------------- xxx --------------------------------------------------
The Problem:
Given the prize-money for each tournament, and the maximum consecutive days Merry and Pippin can play without break, output the maximum prize money they can win.
-------------------------------------------------- xxx --------------------------------------------------
Rules:
There are N tournaments in all, held from day
Merry and Pippin can play at most R consecutive tournaments before they have to rest.
The prize money for all the tournaments will be given to you.
You need to display the maximum total prize money.
-------------------------------------------------- xxx --------------------------------------------------
Example:
Let there be
Let Merry and Pippin be able to play
Let the prize moneys be
So, Merry and Pippin will play on days 1 > 3 > 4 > 5 >6 > 8 > 9 > 10.
Thus, the maximum prize money will be
-------------------------------------------------- xxx --------------------------------------------------
Note:
This is the first in a series of puzzles. This puzzle required you to display the maximum prize money. The second requires you to display the path. It is recommended to solve the second puzzle after solving this.
Input
Line 1: An integer N
Line 2: An integer R
Next N Lines: Integers PRIZE, the prize money for the tournaments respectively
Line 2: An integer R
Next N Lines: Integers PRIZE, the prize money for the tournaments respectively
Output
Line 1: An integer MAX_MONEY, the maximum prize money possible
Constraints
Example
Input
7 3 13 12 11 9 16 17 100
Output
169
A higher resolution is required to access the IDE