View Code of Problem 3699

#include<string>
#include<cstring>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
long long int  k[2010];
double f[2010];
int main()
{
	int l, n;
	while (cin >> l >> n)
	{
		int minid = 0;
		double min=999999;
		for (int i = 0;i < n;i++)
			cin >> k[i];
		for (int i = 0;i < n;i++)
			cin >> f[i];
		for (int i = 0;i <= l;i++)
		{
			double sum = 0;
			for (int j = 0;j < n;j++)
			{
				int s = abs(i - k[j]);
				double harm = f[j] - s;
				if (harm < 0)
					harm = 0;
				sum += harm;
			}
			/*if (i == 0)
			{
				min = sum;
			}*/
			//cout << sum << " " << endl;
			if (sum < min)
			{
				min = sum;
				minid = i;
			}
		}
		cout << minid << endl;
		cout << min<< endl;
	}
}