View Code of Problem 131

#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
using namespace std;
 
int main()
{
	
	
	int L, N;
	while (cin >> L >> N) {
		int arr[2100] = { 0 };
		int k[2100] = { 0 };
		for (int i = 0; i < N; i++) {
			cin >> k[i];
		}
		for (int i = 0; i < N; i++) {
			cin >> arr[i];
		}
 
		int min = 1e9;
		int minx = 0;
		for (int i = 0; i <= L; i++) {
			int sum = 0;
			for (int j = 0; j < N; j++) {
				int s = abs(k[j] - i);
				int dam = arr[j] - s;
				if (dam < 0)dam = 0;
				sum += dam;
			}
			if (sum < min) {
				min = sum;
				minx = i;
			}
		
		}
		cout << minx << endl;
		cout << min << endl;
		
	}
	
 
	return 0;
}