5585번 거스름돈

 기본적인 그리디 문제.

 

 

#include <iostream>
 
using namespace std;
 
int cur=1000;
int N;
int change[6]={1,5,10,50,100,500};
int ans;
 
void solved(int money){
    while(money!=0){
        for(int i=5;i>=0;i--){
            while(money-change[i]>=0){
                money-=change[i];
                ans++;
            }
        }
    }
    
    cout << ans << endl;
}
 
int main(){
    int Won;
    
    cin >> N;
    
    Won=cur-N;
    
    solved(Won);
}