1048 Find Coins (25分) (二分、散列）

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
const int maxn = 100001;

//散列法
int main()
{
//     freopen("1.txt","r",stdin);
    int n,m,num[maxn];
    cin>>n>>m;
    map<int,int> mp;
    for(int i = 0;i<n;i++)
    {
        cin>>num[i];
        mp[num[i]] += 1;
    }
    sort(num,num+n);
    int flag = 0;

    for(int i = 0;i<n;i++)
    {
        int t = m - num[i];
        if(mp[t] >= 1 && t!=num[i])
        {
            printf("%d %d",num[i],t);
            flag = 1;
            break;
        }
        else if(mp[t] >= 2 && t==num[i])
        {
            printf("%d %d",num[i],t);
            flag = 1;
            break;
        }
    }
    if(flag == 0)
        printf("No Solution");
    return 0;
}

//二分法
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
const int maxn = 100001;


int main()
{
//     freopen("1.txt","r",stdin);
    int n,m,num[maxn];
    cin>>n>>m;
    for(int i = 0;i<n;i++)
    {
        cin>>num[i];
    }
    sort(num,num+n);
    int *flag;
    int i;
    int temp;
    int mark = 0;
    for(i = 0;i<n;i++)
    {
        int t = m - num[i];
        flag = upper_bound(num,num+n,t);
        temp = flag - num - 1;

        if(temp > i && temp <= n - 1 && num[temp] == t)
        {
            mark = 1;
            break;
        }
        else
            continue;
    }
    if(mark == 0)
        printf("No Solution");
    else
        printf("%d %d",num[i],num[temp]);
    return 0;
}