求最少和最多硬幣數(shù)目

#include<iostream>
#include<algorithm>
using namespace std;
int minx[1000001];
int maxx[1000001];
const int INF=100010;
int v[6]={0,1,5,10,50,100};//零錢幣值


int main(){
    FILE *fin = freopen("1.txt","r",stdin);
    int kase;cin>>kase;getchar();
    while(kase--){
        
        int P;cin>>P;
        for(int i =1 ;i<=P;i++){
            minx[i]=INF;maxx[i]=-INF;
        }
        minx[0]=maxx[0]=0;


        for(int i =1;i<=P;i++){
            for(int j=1;j<=5;j++){
                if((i-v[j])>=0){
                    minx[i] = min(minx[i],minx[i-v[j]]+1);
                    maxx[i] = max(maxx[i],maxx[i-v[j]]+1);
                }
            }
        }
        cout<<minx[P]<<" "<<maxx[P]<<endl;
    }

}