Submission

Status:

P-P--P-P--

Subtask/Task Score:

40/100

Score: 40

User: Folk_DIWA

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-10-14 00:22:29

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main(){
    cin.tie(0)->sync_with_stdio(0);
    
    int n; cin >> n;
    vector <int> v(n);
    
    unordered_map <int,int> mp;
    vector <pair <int,int>> ans;

    for(int i=0; i<n; i++) cin >> v[i];
    
    int k; cin >> k;
    for(int i=0; i<n; i++){
        
        int t = abs(v[i]-k);

        if(mp.count(t)){

            int idx = mp[t];
            ans.push_back({idx, i});

        }

        mp[v[i]] = i;

    }

    if(ans.empty()){
        cout << "no";
        return 0;
    }

    for(auto &x : ans) cout << v[x.first] << ' ' << v[x.second] << '\n';


    return 0;
}