#3116

Kth Smallest Amount With Single Denomination Combination

hard · 20% accepted · 252 likes · top 1%

array · math · binary search · bit manipulation · combinatorics · number theory

⊣ practice⊣ open on leetcode ↗

Description

You are given an integer array coins representing coins of different denominations and an integer k.

You have an infinite number of coins of each denomination. However, you are not allowed to combine coins of different denominations.

Return the kth smallest amount that can be made using these coins.

Solution