HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Contests > CEN112 Questions 2016 > problem:


HW092. 51081 - Fish Pond I

CEN112 Questions 2016

Start: Mar.30.2016 at 03:10:22 PM
Finish: Apr.01.2016 at 05:00:00 AM
The contest is finished!
• Contest scoreboard

Contest problems

• 15-PE2-2. 51086 - Top popular student
• 15-PE2-3. 50982 - A thief in labyrinth
• 15-PE2-4. 50983 - Course Selection
• 15-PE2-6. 50985 - Books Waiting
• 15-PE2-8. 50987 - Very Looong Queue
• 15-RE-2. 50999 - Overlapping Trips
• 3. 51002 - The most successful classes
• 4. 51003 - Double Prime
• HW092. 51081 - Fish Pond I
• HW092. 51062 - Fish Pond II

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Ibrahim Mesecan.

Fish Pond I

Question: You work in a fishpond which has a computerized system. The system catches fishes when the fishes pass through a channel. Whenever it takes one fish, it does not have time to take the next fish.

Question: Write a program that defines the max amount to take (max total size) for all the fishes.

Input specification: First you will be given an integer, the number of fish (n). Then, starting from the following line, you will be given n integers (there may be several integers in every line - integers from 1 to 1000) where n is less than 25.

Output specification: Show one integer.

Sample Input I
9
5 3 2 5 5 4 1 3 2
Sample Input II
9
5 1 5 2 4 4 3 2 2
Sample Output I
17
Sample Output II
19

Explanation (Sample Input 1): If fish1 (5), fish4 (5), fish6 (4), and fish8 (3) are taken the max total size (17) are taken. (Sample Input 2): fish 1, 3, 5, 7 and 9 are taken (19).



Для отправки решений необходимо выполнить вход.

www.contester.ru