PAT A 1048.Student List for Course (25)

题目

Eva loves to collect coins from all over the universe, including someother planets like Mars. One day she visited a universal shopping mall whichcould accept all kinds of coins as payments. However, there was a specialrequirement of the payment: for each bill, she could only use exactly two coinsto pay the exact amount. Since she has as many as 10⁵ coins withher, she definitely needs your help. You are supposed to tell her, for anygiven 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 contains2 positive numbers: N (<=10⁵, the total number of coins) andM(<=10³, the amount of money Eva has to pay). The second linecontains N face values of the coins, which are all positive numbers no morethan 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

 

记录各个价格的货币出现的数量，依次查找1~m/2，m-v是否存在（注意v=m-v的情况）

 

代码：

#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
	int n,m;
	cin>>n>>m;
	int coin[1001]={0};	//记录各个价值的硬币数量，需要适配价值，故需要2倍

	int value;
	int i,j;
	for(i=0;i<n;i++)	//输入数据
	{
		scanf("%d",&value);
		coin[value]++;
	}

	for(i=1;i<=m/2;i++)	//扫描范围
	{
		if(coin[i]>=1&&coin[m-i]>=1&&i!=m-i)	//i!=m-i
		{
			cout<<i<<" "<<m-i;
			return 0;
		}
		if(coin[i]>=2&&i==m-i)	//i==m-i
		{
			cout<<i<<" "<<m-i;
			return 0;
		}
	}

	cout<<"No Solution";

	return 0;
}