PAT (Advanced Level) Practise 1048 Find Coins (25)

1048. Find Coins (25)

时间限制

100 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 10⁵ 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⁵, the total number of coins) and M(<=10³, 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 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

题意：给你n个硬币，选出两个硬币组成给定的金额，若有多个答案，输出最小的答案，若没有答案输出“No Solution”

解题思路：先记录每种金额的硬币出现了几次，将所有硬币排序后，暴力遍历即可

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <functional>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

int n,m;
int a[100009];
int visit[100009];

int main()
{
    while(~scanf("%d %d",&n,&m))
    {
        memset(visit,0,sizeof visit);
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]),visit[a[i]]++;
        int j=0;
        sort(a,a+n);
        for(;j<n;j++)
        {
            if(visit[m-a[j]]>1&&a[j]==m-a[j]) {printf("%d %d\n",a[j],m-a[j]);break;}
            else if(visit[m-a[j]]&&a[j]!=m-a[j]) {printf("%d %d\n",a[j],m-a[j]);break;}
        }
        if(j>=n) printf("No Solution\n");
    }
    return 0;
}