解题思路:
注意事项:
参考代码:#include
#include
void sort2(int a[],int n)
{
int i,j,temp;
for(i=0;i
{
for(j=0;j
{
if(a[j]>a[j+1])
{
temp=a[j+1];
a[j+1]=a[j];
a[j]=temp;
}
}
}
}
int main()
{
int m,n,i,j,min,left,right;
int f[1001],g[1001];
scanf("%d%d",&m,&n);
for(i=0;i
scanf("%d",&f[i]);
for(i=0;i
scanf("%d",&g[i]);
sort2(f,m);
sort2(g,n);
if(f[m-1]<=g[0])
{
printf("%d\n",g[0]-f[m-1]);
return 0;
}
else if(f[0]>=g[n-1])
{
printf("%d\n",f[0]-g[n-1]);
return 0;
}
else
{
min=abs(f[0]-g[0]);
for(i=0;i
for(j=0;j
{
if(min>abs(f[i]-g[j]))
min=abs(f[i]-g[j]);
if(min==0)
{
printf("0\n");
return 0;
}
}
printf("%d\n",min);
return 0;
}
}