当前位置: 首页 > news >正文

1048. Find Coins (25)

1048. Find Coins (25)

#include <iostream>
#include <algorithm>using namespace std;int c[510], num[100010];int main()
{int n, m;scanf("%d%d", &n, &m);int i;for(i = 1; i <= n; i++){scanf("%d", &num[i]);c[num[i]]++;}sort(num + 1, num + n + 1);int cha, flag = 0;for(i = 1; i <= n; i++){cha = m - num[i];c[num[i]]--;if(cha > 0 && cha <= 500 && c[cha] > 0){flag = 1;printf("%d %d\n", num[i], cha);break;}}if(flag == 0){printf("No Solution\n");}system("pause");return 0;
}