Submission

Score: 60

User: KurtCobain

Problemset: จับคู่เลขมงคล

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-03 16:07:34

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> birthdays(n);
    for (int i = 0; i < n; i++) {
        cin >> birthdays[i];
    }
    int check;
    cin >> check;

    vector<pair<int, int>> result;

    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (birthdays[i] + birthdays[j] == check) {
                int big = max(birthdays[i], birthdays[j]);
                int small = min(birthdays[i], birthdays[j]);
                result.push_back({big, small});
            }
        }
    }

    if (result.empty()) {
        cout << "No";
    } else {
        sort(result.begin(), result.end(), [](pair<int,int> a, pair<int,int> b) {
            if (a.first != b.first) return a.first > b.first;
            return a.second > b.second;
        });

        for (auto &p : result) {
            cout << p.first << " " << p.second << '\n';
        }
    }
}