甲级1029 Median (25分)
测试点3过不了啊😫
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/73d97182690a31ca69f3e2778ea1246c.png)
还有一点不明白
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/18e805ad49c61c416340207ef4e84f22.png)
为啥要加&?
我用的long long *array,但是我没加&时就是过不了啊啊啊啊啊(;´д`)ゞ
等待大佬解答
题目如下
1029 Median (25分)
Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 12, and the median of S2 = { 9, 10, 15, 16, 17 } is 15. The median of two sequences is defined to be the median of the nondecreasing sequence which contains all the elements of both sequences. For example, the median of S1 and S2 is 13.
Given two increasing sequences of integers, you are asked to find their median.
Input Specification:
Each input file contains one test case. Each case occupies 2 lines, each gives the information of a sequence. For each sequence, the first positive integer N (≤2×105) is the size of that sequence. Then N integers follow, separated by a space. It is guaranteed that all the integers are in the range of long int.
Output Specification:
For each test case you should output the median of the two given sequences in a line.
Sample Input:
4 11 12 13 14
5 9 10 15 16 17
Sample Output:
13
代码如下:
#include<stdio.h>
#include<stdlib.h>
int main()
{
long long N,M,i=0,j=1,*array,count=0,mid;
scanf("%lld",&N);
array=(long long*)calloc(N,sizeof(long long));
for(i=1;i<=N;i++)
{
scanf("%lld",&array[i]);
}
scanf("%lld",&M);
mid=(N+M+1)/2;
for(i=0;i<M;i++)
{
long long t;
scanf("%lld",&t);
while(j<=N&&array[j]<=t)
{
count++;
if(count==mid)
{
printf("%lld\n",array[j]);
return 0;
}
j++;
}
count++;
if(count==mid)
{
printf("%lld\n",t);
return 0;
}
}
while(j<N)
{
count++;
if(count==mid)
{
printf("%lld\n",array[j]);
return 0;
}
j++;
}
return 0;
}