HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Dynamic programming & Greedy > problem:


50686 - The Container

Guest
• Review clarifications (1)

Section problems

• 50997 - Dynamic Knights
• 51010 - Max Sequential Sum
• 50936 - Saving the Soldiers
• 51072 - Castle on chessboard
• 51075 - Shortest Path for Bishop
• 50979 - Minimum access cost for BST
• 50688 - Epoka Furgon
• 50689 - The biggest building block
• 50686 - The Container
• 50524 - Elevator
• 50536 - Epoka Furgon Shpk
• 50682 - Hotel Durres
• 50526 - Gold Market
• 50930 - Tom and Jerry
• 50488 - Connecting Wires
• 50842 - Minimum Sum Triangle - DP
• 50676 - Cinema Millennium

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.

The Container

A Cargo shipping company, uses large container ships and bulk carriers to carry cargos from different people. The cargos cannot be separated into pieces and the ship can carry at most certain amount of tones.

Question:
Given a set of items determine the max weight that can be carried such that it is less than or equal to a given capacity.

Input specification
Firstly, you are given two integer numbers (n and C) where n denotes the number of items and C denotes the total amount of tones (capacity) that the ship can carry. The next line will have n integer numbers where 1 ≤ n ≤ 100 and 1 ≤ C ≤ 1000. Each cargo item can be between 1 and 20 tones.

Output specification
Show just one integer number: max weight that can be carried with the ship.

Sample Input I   
5 15
3 4 5 6 8
Sample Input II   
8 15
2 2 2 2 2 2 2 2
Sample Output I   
15
Sample Output II   
14


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

www.contester.ru