Submission
Status:
P-PPPP-PPP
Subtask/Task Score:
80/100
Score: 80
User: sakuragichan
Problemset: จับคู่เลขมงคล
Language: cpp
Time: 0.002 second
Submitted On: 2026-10-09 21:24:23
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int arr[n];
bool visited[n] = {false};
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int sum;
cin >> sum;
for (int i = 0; i < n; i++) {
if (!visited[i]) {
int complement = sum - arr[i];
for (int j = i + 1; j < n; j++) {
if (arr[j] == complement && !visited[j]) {
cout << arr[i] << " " << arr[j] << endl;
visited[i] = true;
visited[j] = true;
break;
}
}
}
}
return 0;
}