-
Notifications
You must be signed in to change notification settings - Fork 0
/
Nuts and Bold problem.cpp
71 lines (66 loc) · 1.05 KB
/
Nuts and Bold problem.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include<iostream>
using namespace std;
class Solution{
public:
void matchPairs(char nuts[], char bolts[], int n)
{
int k=0,cons;
char temp[n];
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(nuts[i]==bolts[j])
temp[k]=bolts[j];
}
k++;
}
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(temp[i]>temp[j])
{
cons=temp[i];
temp[i]=temp[j];
temp[j]=cons;
}
}
}
for(int i=0;i<n;i++)
{
nuts[i]=temp[i];
bolts[i]=temp[i];
}
}
};
int main()
{
int t;
cin>> t;
while (t--){
int n;
cin>>n;
char nuts[n],bolts[n];
for(int i=0;i<n;i++)
{
cin>>nuts[i];
}
for(int i=0;i<n;i++)
{
cin>>bolts[i];
}
Solution ob;
ob.matchPairs(nuts,bolts,n);
for(int i=0;i < n; i++)
{
cout<<nuts[i]<<" ";
}
for(int i=0;i<n;i++)
{
cout<< bolts[i]<<" ";
}
cout<<"\n";
}
return 0;
}