fork download
copy 
  1. #include <stdio.h>
  2. #include <math.h>
  3.  
  4. int n,m,posp[100001],posf[100001],len[100001]={100},sum=0,i,j;
  5.  
  6. int abs()
  7. {
  8. 	return (posp[i]-posf[j]<0)?!(posp[i]-posf[j]):posp[i]-posf[j];
  9. }
  10.  
  11. int main()
  12. {
  13.     scanf("%d %d",&n,&m);
  14.  
  15.     for(i=1;i<=n;i++)
  16.         scanf("%d",&posp[i]);
  17.  
  18.     for(i=1;i<=m;i++)
  19.         scanf("%d",&posf[i]);
  20.  
  21.     for(i=1;i<=n;i++)  
  22.     {
  23.         for(j=1;j<=m;j++)
  24.             if(abs(posp[i]-posf[j])<len[i])
  25.                 len[i]=abs(posp[i]-posf[j]);
  26.         sum+=len[i];
  27.         printf("%d",len[i]);
  28.     }   
  29.  
  30.     printf("%d",sum);
  31.  
  32. }
Success #stdin #stdout 0s 4524KB
comments (?)
stdin
copy 
3 2
12 50 81
27 73
stdout
copy 
0000
https://ideone.com/281Cju
language:
C (gcc 8.3)
created:
4 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!