-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathkth.cpp
63 lines (58 loc) · 1.06 KB
/
kth.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
#include <iostream>
using namespace std;
void kth(int arr1[], int arr2[], int n, int m, int x, int arr3[])
{
//int arr3[n + m];
int i = 0;
int j = 0;
int k = 0;
while (i < n && j < m)
{
if (arr1[i] < arr2[j])
{
arr3[k] = arr1[i];
i++;
k++;
}
else
{
arr3[k] = arr2[j];
k++;
j++;
}
}
while (i < n)
{
arr3[k] = arr1[i];
i++;
k++;
}
while (j < m)
{
arr3[k] = arr2[j];
j++;
k++;
}
int ele = 0;
for(int i=0; i<x; i++)
{
ele = arr3[i];
}
//return ele;
cout<<ele<<endl;
}
int main()
{
int arr1[] = {100, 112, 256, 349, 770};
int arr2[] = {72, 86, 113, 119, 265, 445, 892};
int n = sizeof(arr1)/sizeof(arr1[0]);
int m = sizeof(arr2)/sizeof(arr2[0]);
int x = 7;
int arr3[n+m] = {0};
kth(arr1,arr2,n,m,x,arr3);
// for(int i=0; i<n+m; i++)
// {
// cout<<arr3[i] << " ";
// }
return 0;
}