两个数列求中位数,简单排序取中位数,却超时了3组,以后再看。后仔细看题目发现,两个数列已是排好序了的,改用合并排序,过了。我的程序跟别人的一模一样,却有两点没过。
//1029 22:00
#include<stdio.h>
#include<stdlib.h>
const int NUM=10000005;
long a[NUM],b[NUM];
int cmp(const void *a, const void *b)
{
int *x=(int *)a;
int *y=(int *)b;
return *x - *y;
}
int main()
{
int n,m,i,j;
//freopen("C:\\Documents and Settings\\Administrator\\桌面\\input.txt","r",stdin);
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
scanf("%d",&m);
for(j=i;j<n+m;j++){
scanf("%d",&a[j]);
}
qsort(a,n+m,sizeof(a[0]),cmp);
int mid=(n+m+1)/2;
printf("%d",a[mid-1]);
return 0;
}
我的代码:
#include<cstdio>
const int NUM=1000005;
long a[NUM];
long b[NUM];
long res[2000005];
int main()
{
int n1,n2,i,j;
//freopen("C:\\Documents and Settings\\Administrator\\桌面\\input.txt","r",stdin);
scanf("%d",&n1);
for(i=0;i<n1;i++){
scanf("%d",&a[i]);
}
scanf("%d",&n2);
for(j=0;j<n2;j++)
scanf("%d",&b[j]);
i=0;
j=0;
int x=0;
while(i<n1&&j<n2){
if(a[i]<b[j]){
res[x++]=a[i++];
} else if(a[i]>b[j]){
res[x++]=b[j++];
} else {
res[x++]=a[i++];
res[x++]=b[j++];
}
}
if(i<n1&&j>=n2){
for(;i<n1;i++){
res[x++]=a[i];
}
} else if(i>=n1&&j<n2){
for(;j<n2;j++){
res[x++]=b[j];
}
}
if((n1+n2)%2!=0)
printf("%d\n",res[(n1+n2)/2]);
else
printf("%d\n",res[((n1+n2)/2)-1]);
return 0;
}
AC代码:
#include <stdio.h>
int num1[1000002];
int num2[1000002];
int num_fin[2000002];
int main()
{
int len1,len2;
scanf("%d",&len1);
int i;
for(i=0;i<len1;i++){
scanf("%d",&num1[i]);
}
scanf("%d",&len2);
for(i=0;i<len2;i++){
scanf("%d",&num2[i]);
}
int j=0,k=0;
i=0;
while(i<len1&&j<len2){
if(num1[i]<num2[j]){
num_fin[k++]=num1[i++];
}else if(num2[j]<num1[i]){
num_fin[k++]=num2[j++];
}else{
num_fin[k++]=num1[i++];
num_fin[k++]=num2[j++];
}
}
if(i<len1&&j>=len2){//num2已经结束
for(;i<len1;i++){
num_fin[k++]=num1[i];
}
}else if(i>=len1&&j<len2){
for(;j<len2;j++){
num_fin[k++]=num2[j];
}
}
if((len1+len2)%2){
printf("%d\n",num_fin[(len1+len2)>>1]);
}else{
printf("%d\n",num_fin[((len1+len2)>>1)-1]);
}
}