forked from int32bit/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathkth.c
34 lines (34 loc) · 807 Bytes
/
kth.c
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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
int getkth(int s[], int m, int l[], int n, int k) {
if (m > n)
return getkth(l, n, s, m, k);
if (m == 0)
return l[k - 1];
if (k == 1)
return min(s[0], l[0]);
int i = min(m, k / 2), j = min(n, k / 2);
if (s[i - 1] > l[j - 1])
return getkth(s, m, l + j, n - j, k - j);
else
return getkth(s + i, m - i, l, n, k - i);
}
double getMedia(int a[], int m, int b[], int n)
{
if ((m + n) & 0x1) {
return getkth(a, m, b, n, ((m + n) >> 1) + 1);
} else
return (getkth(a, m, b,n, (m + n) >> 1) + getkth(a, m, b, n, ((m + n) >> 1) + 1)) / 2.0;
}
int main(int argc, char **argv)
{
int a[] = {1,3,5,7,9};
int b[] = {2,4,6};
printf("%d\n", getkth(a, 5, b, 3, 7));
return 0;
}