PAT 甲级 A1048 （2019/02/19）

Posted 2021-02-10 zjsaipplp

#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 1005;
int HashTable[N];
int main() {
    int n, m, a;
    scanf("%d %d", &n, &m);
    for(int i = 0; i < n; i++) {
        scanf("%d", &a);
        ++HashTable[a];
    }
    for(int i = 0; i < N; i++) {
        if(HashTable[i] && HashTable[m - i]) {
            if(i == m - i && HashTable[i] <= 1) {
                continue;
            }
            printf("%d %d
", i, m - i);
            return 0;
        }
    }
    printf("No Solution
");
    return 0;
}