Submission

Score: 60

User: Nuttykub

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-10-02 11:10:58

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> vec;
    for (int i = 0;i < n;i++){
        int t;
        cin >> t;
        vec.push_back(t);
    }
    int lucky;
    cin >> lucky;
    vector<pair<int,int>> ans;
    for (int i = 0;i<n;i++){
        for (int j = i+1;j < n;j++){
            if (i!=j and vec[i]+vec[j]==lucky) ans.push_back({max(vec[i],vec[j]),min(vec[i],vec[j])});
        }
    }
    if (ans.empty()) {
        cout << "No";
        return 0;
    }
    sort(ans.begin(),ans.end(),::greater<pair<int,int>>());
    for (int i = 0;i < ans.size();i++){ 
        cout << ans[i].first << " " << ans[i].second << endl;
    }
}