Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- #define ii long long int
- using namespace std;
- int coin[110];
- ii dp[10500];
- int main()
- {
- int test;
- scanf("%d",&test);
- while(test--)
- {
- int k,n;
- scanf("%d %d",&k,&n);
- dp[0]=0;
- for(int i=0;i<n;i++)
- {
- scanf("%d",&coin[i]);
- }
- for(int i=1;i<=10500;i++)
- {
- dp[i]=9999999;
- }
- for(int i=0;i<n;i++)
- {
- for(int j=coin[i];j<=10500;j++)
- {
- dp[j]=min(dp[j],dp[j-coin[i]]+1);
- }
- }
- for(int i=k;i<=10500;i++)
- {
- if(dp[i]!=9999999)
- {
- printf("%d %d\n",i,dp[i]);
- break;
- }
- }
- memset(dp,0,sizeof dp);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement