Java: Greedy Algorithm to find Minimum number of Coins

Problem Statement:

Given a value of V Rs and an infinite supply of each of the denominations {1, 2, 5, 10, 20, 50,

100, 500, 1000} valued coins/notes, The task is to find the minimum number of coins and/or

notes needed to make the change?

Example

Input:

V = 70

Output:

2
We need a 50 Rs note and a 20 Rs note.