Skip to content

Practice Maximum Value of K Coins From Piles

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#2218
LeetCode Problem

Maximum Value of K Coins From Piles

Problem Statement

There are n piles of coins on a table. Each pile consists of a positive number of coins of assorted denominations. In one move, you can choose any coin on top of any pile, remove it, and add it to your wallet. Given a list piles, where piles[i] is a list of integers denoting the composition of the ith pile from top to bottom, and a positive integer k, return the maximum total value of coins you can have in your wallet if you choose exactly k coins optimally.

Source: Maximum Value of K Coins From Piles on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
piles = [[1,100,3],[7,8,9]], k = 2
Output
101

# Example 2

Input
piles = [[100],[100],[100],[100],[100],[100],[1,1,1,1,1,1,700]], k = 7
Output
706

Constraints

n == piles.length
1 <= n <= 1000
1 <= piles[i][j] <= 10^5
1 <= k <= sum(piles[i].length) <= 2000

Related LeetCode Problems

Practice more problems similar to Maximum Value of K Coins From Piles.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.