PAT甲级 1049

属于转载 自己琢磨不出来这么巧妙的解法 算法笔记上应该也有

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int happen[MAXN];
int a[MAXN];
int main(void)
{
    freopen("pat0314/in.txt","r",stdin);
    int n;
    int total;

    cin>>n>>total;
    for(int i = 0;i<n;i++)
    {
        cin>>a[i];
        happen[a[i]]++;
    }
    sort(a,a + n);
    for(int i = 0;i<n;i++)
    {
        if(happen[a[i]] > 0 && happen[total - a[i]] > 0 && a[i] != total - a[i])
        {
            cout<<a[i]<<" "<<total - a[i];
            return 0;
        }
        else if(a[i] == total - a[i] && happen[a[i]] >= 2)
        {
            cout<<a[i]<<" "<<total - a[i];
            return 0;
        }


    }
    cout<<"No Solution";
    return 0;



}