View Code of Problem 3699

#include<stdio.h>
#include<limits.h>
#include<math.h>
int main(){
	int l,n;
	while(scanf("%d %d",&l,&n)!=EOF){ //l两者之间距离  n个球 
		int a[n],b[n];              //坐标 能量
		int min = INT_MAX;
		int i,j;
		for(i = 0;i < n; i++){
			scanf("%d",&a[i]);
		}
		for(i = 0;i < n; i++){
			scanf("%d",&b[i]);
		}
		int sum,index = 0;
		for(i = 0;i < l; i++){
			sum = 0;
			for(j = 0;j < n; j++){
				int s = fabs(a[j]-i);
				if(b[j]-s<0)
					sum+=0;
				else
					sum+=(b[j]-s);
			}
			if(sum<min){
				min = sum;
				index = i;
			}
		}
		printf("%d\n",index); 
		printf("%d\n",min);
	}
}