PAT甲级练习1048. Find Coins (25)

最新推荐文章于 2021-04-13 16:32:06 发布

原创最新推荐文章于 2021-04-13 16:32:06 发布 · 164 阅读

0 ·

CC 4.0 BY-SA版权

PAT甲级练习专栏收录该内容

104 篇文章

订阅专栏

本文介绍了一个寻找两个硬币面额组合以支付特定金额的问题。通过使用数组记录硬币出现频率的方法，解决如何从大量硬币中找到合适的两种硬币进行支付，并确保解决方案的唯一性和最小值优先。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1048. Find Coins (25)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 10⁵ 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 V₁ and V₂ (separated by a space) such that V₁ + V₂ = M and V₁ <= V₂. If such a solution is not unique, output the one with the smallest V₁. 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

用一个数组表示数字出现的频率，排除一个数字被用两次的情况

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <string.h>

using namespace std;

const int MAX=1e5+10;
int f[MAX];

int main(){

	int n, m, x, l;
	scanf("%d%d", &n, &m);
	for(int i=0; i<n; i++){
		scanf("%d", &x);
		f[x]++;
	}

	for(int i=0; i<MAX; i++){
		if(f[i]){
			f[i]--;//排除单个算两次的情况
			if(m>i && f[m-i]){
				printf("%d %d", i, m-i);
				cin>>n;
				return 0;
			}
			f[i]++;
		}
	}

	printf("No Solution\n");
	cin>>n;
	return 0;
}