PAT甲 1048. Find Coins (25)

最新推荐文章于 2025-03-15 10:55:59 发布

原创最新推荐文章于 2025-03-15 10:55:59 发布 · 290 阅读

0 ·

CC 4.0 BY-SA版权

PAT 专栏收录该内容

39 篇文章

订阅专栏

本文介绍了一个支付场景下的算法问题——FindCoins，需从大量硬币中找出两个面额之和等于给定金额的组合，且只能使用两种硬币进行支付。文章提供了具体的输入输出规格，并附带了C++实现代码。

1048. Find Coins (25)

时间限制

50 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<cstring>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
int cnt[5005];  
int main()
{
  int i,j,temp;
  int n,m;
  scanf("%d%d",&n,&m);
  for (i=0;i<n;i++)
    {
      scanf("%d",&temp);
      cnt[temp]++; 
    }
  for (i=1;i<=m-i;i++)
    {
   	  cnt[i]--;cnt[m-i]--;
	  if (cnt[i]>=0&&cnt[m-i]>=0)
	      break;
	}
  if (i<=m-i)
    printf("%d %d\n",i,m-i);
  else 
    printf("No Solution\n");
  return 0;
}