PAT (Advanced Level) 1048 Find Coins （25 分）

最新推荐文章于 2019-03-15 19:04:30 发布

isunLt

最新推荐文章于 2019-03-15 19:04:30 发布

阅读量151

点赞数

分类专栏： PAT 文章标签： PAT

本文链接：https://blog.csdn.net/isunlt/article/details/87869745

版权

PAT 专栏收录该内容

92 篇文章 1 订阅

订阅专栏

本文探讨了1048FindCoins问题，这是一个关于在宇宙购物中心使用两种硬币支付特定金额的挑战。输入包含硬币数量和目标支付金额，任务是在硬币集合中找到两个硬币面额，其总和等于给定金额。如果存在多个解决方案，则选择最小的面额组合。

摘要由CSDN通过智能技术生成

1048 Find Coins （25 分）

Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she could only use exactly two coins to pay the exact amount. Since she has as many as 105 coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find two coins to pay for it.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (≤10⁵, the total number of coins) and M (≤10³, the amount of money Eva has to pay). The second line contains N face values of the coins, which are all positive numbers no more than 500. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the two face values V1 and V2 (separated by a space) such that V1+V2=M and V1≤V2. If such a solution is not unique, output the one with the smallest V1. If there is no solution, output No Solution instead.

Sample Input 1:

8 15
1 2 8 7 2 4 11 15

Sample Output 1:

4 11

Sample Input 2:

7 14
1 8 7 2 4 11 15

Sample Output 2:

No Solution

Code:

#include <iostream>
#include <vector>
#pragma warning(disable:4996)
using namespace std;

int main()
{
	int n, m;
	scanf("%d%d", &n, &m);
	vector<int> vec(1010, 0); // 开505错，但题目说硬币面值不超过500，奇怪
	int min_num = 0x3f3f3f3f;
	for (int i = 0; i < n; i++)
	{
		int t; scanf("%d", &t);
		if (min_num > t) min_num = t;
		vec[t]++;
	}
	int c1 = min_num, c2 = -10000000;
	while (c1 <= m / 2)
	{
		if (vec[c1] > 0)
		{
			vec[c1]--;
			if (vec[m - c1] > 0)
			{
				c2 = m - c1;
				break;
			}
			vec[c1]++;
		}
		c1++;
	}
	if (c2 == -10000000) printf("No Solution\n");
	else printf("%d %d\n", c1, c2);
	return 0;
}