### 题目

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 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 (<=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.

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

### 解题思路

• 1.先排序，然后从计算a[i]+a[j],i，j分别以数列的首尾为初始值，然后比较他们和与m的大小，然后再相应的i++或者j--

### 代码

#include<cstdio>
#include<algorithm>
using namespace std;
int num[100000+5];
int main(int argc, char *argv[])
{
int n,m;
scanf("%d %d",&n,&m);
for (int i = 0; i < n; ++i) {
scanf("%d",&num[i]);
}
sort(num,num+n);
for (int i = 0,j = n - 1; i < j; ) {
if (num[i] + num[j] > m) {
j--;
}else if (num[i] + num[j] < m) {
i++;
}else {
printf("%d %d\n",num[i],num[j]);
return 0;
}
}
printf("No Solution\n");
return 0;
}

#### 下面这段段错误错在哪？始终没找到==

#include<cstdio>
#include<algorithm>
using namespace std;
int num[100000+5];
int main(int argc, char *argv[])
{
int n,m;
scanf("%d %d",&n,&m);
for (int i = 0; i < n; ++i) {
scanf("%d",&num[i]);
}
if (n<=1) {
printf("No Solution\n");
}else {
sort(num,num+n);
bool isFind = false;
for (int i = 0; i < n - 1,num[i]<m; i++) {

for (int j = i+1; j < n,num[j]<m; j++) {
if (num[i]+num[j]==m) {
printf("%d %d\n",num[i],num[j]);
isFind = true;
break;
}
}
if (isFind) {
break;
}
}
if (!isFind) {
printf("No Solution\n");
}
}
return 0;
}

#### 【PAT】1048. Find Coins (25)

2013-08-26 19:44:58

#### 【PAT 1068】 Find More Coins 背包问题

2013-12-15 15:13:25

#### 1037. Magic Coupon (25)-PAT甲级真题（贪心算法）

2016-08-16 20:10:59

#### 1068. Find More Coins (30)-PAT甲级真题（01背包）

2016-08-22 17:37:42

#### PAT 1076. Forwards on Weibo

2014-03-09 02:14:21

#### PATL2-008：最长对称子串（dp）

2017-03-12 16:14:19

#### PAT乙级.1037. 在霍格沃茨找零钱（20）

2016-08-18 21:08:40

#### PAT乙级1037

2017-01-09 18:54:13

#### 【DP入门】动态规划初步-几类子序列问题

2017-08-06 23:03:31

#### 1007. Maximum Subsequence Sum (25)-PAT甲级真题（动态规划dp）

2016-08-07 20:13:17

## 不良信息举报

PAT 1037 Find Coins (25)（dp子序列）