Create Minimum number of Coins .cpp

Given an infinite supply of each denomination of Indian currency { 1, 2, 5, 10, 20, 50, 100, 200, 500, 2000 } and a target value N.
Find the minimum number of coins and/or notes needed to make the change for Rs N. You must return the list containing the value of coins required.

https://practice.geeksforgeeks.org/problems/-minimum-number-of-coins4426/0

Author: Rupali409

Minimum number of Coins .cpp

@@ -0,0 +1,54 @@
+// Initial Template for C++
+
+#include <bits/stdc++.h>
+using namespace std;
+
+ // } Driver Code Ends
+// User function Template for C++
+
+class Solution{
+public:
+    vector<int> minPartition(int x)
+    {
+        vector<int>st;
+        int a[]={1,2,5,10,20,50,100,200,500,2000};
+    int n=10;
+
+sort(a,a+n,greater<int>());
+int ans=0;
+for(int i=0;i<n;i++){
+    // int res=x/a[i];
+    // if(res>0 ){
+    // ans=ans+res;
+    //  x=x%a[i];
+    //  st.push_back(a[i]);
+    // }
+      while (x >= a[i]) {
+            x -= a[i];
+            st.push_back(a[i]);
+        }
+    
+}
+
+
+return st;
+    }
+};
+
+// { Driver Code Starts.
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int N;
+        cin>>N;
+        
+        Solution ob;
+        vector<int> numbers = ob.minPartition(N);
+        for(auto u: numbers)
+            cout<<u<<" ";
+        cout<<"\n";
+    }
+    return 0;
+}  // } Driver Code Ends