1048. Find Coins (25)解题报告

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
using namespace std;

struct solution {
    int v1, v2;
};

bool comp(solution s1, solution s2);

int main(void) {
    int arr[1010], i, tmp, n, m;
    solution s;
    vector<solution> v;
    memset(arr, 0, sizeof(arr));
    scanf("%d %d", &n, &m);
    for (i = 0; i < n; i++) {
        scanf("%d", &tmp);
        arr[tmp]++;
        if (m - tmp > 0 && arr[m - tmp] && m - tmp != tmp) {
            s.v1 = tmp > m - tmp ? m - tmp : tmp;
            s.v2 = tmp > m - tmp ? tmp : m - tmp;
            v.push_back(s);
        }
        else if (m - tmp == tmp && arr[tmp] > 1) {
            s.v1 = s.v2 = tmp;
            v.push_back(s);
        }
    }
    if (v.size()) {
        sort(v.begin(), v.end(), comp);
        printf("%d %d\n", v[0].v1, v[0].v2);
    }
    else {
        puts("No Solution");
    }
    return 0;
}

bool comp(solution s1, solution s2) {
    return s1.v1 < s2.v1;
}