-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpat 1029.cpp
63 lines (62 loc) · 906 Bytes
/
pat 1029.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 <stdio.h>
#include <assert.h>
int a[1000001],b[1000001];
#define INFI 0x7FFFFFFF
int main()
{
int la,lb,i,j,flag,im,m;
scanf("%d",&la);
for( i = 0 ; i < la ; i++)
{
scanf("%d",a+i);
}
scanf("%d",&lb);
for( i = 0 ; i < lb ; i++)
{
scanf("%d",b+i);
}
i = j = flag = im =0;
m = (la + lb - 1) / 2;
while(1)
{
if( i != la && j != lb)
{
assert(a[i]!=b[j]);
if( a[i] < b[j])
{
i++;
flag =1;
}
else
{
j++;
flag = 2;
}
}
else
{
if( i == la)
{
assert(a[i-1]!=b[j]);
j++;
flag = 2;
}
else
{
assert(a[i]!=b[j-1]);
i++;
flag =1;
}
}
if( im == m)
{
if(flag == 1)
printf("%ld",a[i-1]);
else
printf("%ld",b[j-1]);
break;
}
im++;
}
return 0;
}