Submission

Score: 60

User: kf._.exe

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-15 13:49:21

#include <algorithm>
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define dbg(x) cout << #x << " = " << x  << '\n';
#define int long long
#define dd double
#define ld long double

void solve(){
     int n;cin >> n;
     vector<int> v(n); 
     for(auto &x:v) cin >> x;
     int k;cin >> k;
     sort(v.begin(),v.end());
     bool found = false;
     for(int i=0;i<n;++i){
          vector<int>::iterator it =
                         lower_bound(v.begin()+i+1,v.end(),k-v[i]);
          if(it != v.end() && *it + v[i] == k ) {
               found = true;
               #ifdef ONPC
                    dbg(*it);dbg(v[i]);
               #endif
               cout << *it << " " << v[i] << endl;
          }
     }
     
     if(!found) puts("No");

}

int32_t main(){
       fastio;
           int T = 1;
           //cin >> T
           while(T--) solve();
       return 0;
}