1048 Find Coins (25 分)难度: 一般 / 知识点: 哈希表

Posted 2021-10-22 辉小歌

https://pintia.cn/problem-sets/994805342720868352/problems/994805432256675840

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
map<int,int>mp;
int a[N],n,m;
int main(void)
{
    cin>>n>>m;
    for(int i=0;i<n;i++) cin>>a[i],mp[a[i]]++;
    sort(a,a+n);
    for(int i=0;i<n;i++)
    {
        if( (mp[m-a[i]]&&m-a[i]!=a[i]) || (m-a[i]==a[i])&&mp[a[i]]>=2)
        {
            cout<<a[i]<<" "<<m-a[i];
            return 0;
        }
    }
    cout<<"No Solution";
    return 0;
}