View Code of Problem 3699

#include<iostream>
#include<cstring>
#include<algorithm>
#include<stdio.h>
#include<string.h>
using namespace std;
int main()
{
   int L,N;
   while(scanf("%d%d",&L,&N)!=EOF)
   {
       int num1[N];int num2[N];
       for(int i=0;i<N;i++)
            cin>>num1[i];
       for(int i=0;i<N;i++)
            cin>>num2[i];
       int dian=0,minn=2147483647;
       for(int i=0;i<=L;i++)
       {
           int sum=0,cnt=0;
           for(int j=0;j<N;j++)
           {
               cnt=num2[j]-abs(num1[j]-i);
               //cout<<num[1][j]<<" "<<num[0][j]<<endl;
              // cout<<cnt<<endl;
               if(cnt<0)
                cnt=0;
               // cout<<"cnt  "<<cnt<<"      "<<i<<"    "<<endl;
               sum+=cnt;
           }
           if(sum<minn)
           {
               minn=sum;dian=i;
           }
       }
       cout<<dian<<endl;
       cout<<minn<<endl;
   }
  return 0;
}