# PAT A1048：Find Coins

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 10^5 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^5 , the total number of coins) and M (≤10^3 , 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. 暴力搜索：对于某些测试案例会运行超时
2. 首先对数据进行升序排列，i从0开始，j从n-1开始，只要ij则一直进行迭代判断，如果判断两数相加等于M，则按要求输出这两个数，然后跳出循环。如果两数相加小于M，则令i++。如果两数相加大于M，则令j–。循环跳出之后，如果i=j，则表示无解，按要求输出即可。

``````#includecstdio
#includealgorithm
using namespace std;
const int maxn=100001;
int n,m;
int num[maxn];
void solve()
{
scanf("%d %d",n,m);
for(int i=0;in;i++)
scanf("%d",num[i]);
sort(num,num+n);
int i=0,j=n-1;
while(ij)
{
if(num[i]+num[j]==m)
{
printf("%d %d",num[i],num[j]);
break;
}
else if(num[i]+num[j]m)	i++;
else j--;
}
if(i=j)	printf("No Solution");
}
int main()
{
solve();
return 0;
}
``````
• ###### Unity kinect坐标 转 屏幕坐标
• 