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.

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 15Sample Output 1:

4 11Sample Input 2:

7 14

1 8 7 2 4 11 15Sample Output 2:

No Solution

Main idea of the title: Give n n positive integers and a positive integer m, and ask if there is a pair of numbers a and B (a <= b) in N numbers to make a+b=m true.If there are more than one, output the smallest pair of A.

Analysis: This question may be a simple idea is to save it with an array, and then make a circular judgment, so that each iteration will certainly time out. This non-difficult topic may be an article above, so we use the value as subscript, so as long as iterate through i, the remaining judgment m-i address has no data, the time complexity is only O(n).

```
#include <cstdio>
using namespace std;
int a[1001];
int main ()
{
int n , m , temp;
scanf_s ("%d %d" , &n , &m);
for (int i = 0; i < n; i++)
{
//Use value as subscript, 0 has no data, 1 has data
scanf_s ("%d" , &temp);
a[temp]++;
}
for (int i = 0; i < 1001; i++)
{
if (a[i])
{
//Prevent duplication
a[i]--;
if (m > i && a[m - i])
{
printf ("%d %d" , i , m - i);
return 0;
}
a[i]++;
}
}
printf ("No Solution");
return 0;
}
```