Submission

Status:

PPP--PPP--

Subtask/Task Score:

60/100

Score: 60

User: Nuttykub

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

Language: cpp

Time: 0.005 second

Submitted On: 2026-10-02 11:04:12

#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 = 0;j < n;j++){
            if (i!=j and vec[i]+vec[j]==lucky) ans.push_back({vec[i],vec[j]});
        }
    }
    if (ans.size() == 0) cout << "No";
    sort(ans.begin(),ans.end(),[](const auto& a,const auto& b){
        return a.first>b.first;
    });
    for (int i = 0;i < ans.size()/2;i++){
        cout << ans[i].first << " " << ans[i].second << endl;
    }
}