【通过PAT复习C++与数据结构】PAT-A 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.

输入描述:
Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (<=105, the total number of coins) and M(<=103, 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.

输出描述:
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.
示例1
输入
8 15
1 2 8 7 2 4 11 15
输出
4 11

题目大意

在给定数字序列中找出两个数字使这两个数字的加和等于给定值。

子问题

1. 如何找出这对数字
2. 按照从小到大输出

直觉

开一个bool数组，数组下标代表这个数字，从下标1开始向上遍历，每次遍历的时候访问下标为v2的数组，看是否存在存在则输出。

解决方案

同直觉

复杂度分析

O（m），常数级的复杂度

代码

#include<iostream>
#define max 100010
using namespace std;
int main(){
	int num_coin=0,amount=0;
	cin>>num_coin>>amount;
	int all_coin[max]={0};
	int temp;
	for(int i=1;i<=num_coin;++i){
		cin>>temp;
		all_coin[temp]++;
	}
	for(int i=1;i<max;++i){
		if(all_coin[i]>=1){
			all_coin[i]--;
			if(all_coin[amount-i]>=1){
				cout<<i<<" "<<amount-i;
				return 0;
			}
		}
	}
	cout<<"No Solution";
	return 0;
}