#include<string> #include<cstring> #include<iostream> #include<cstdio> #include<algorithm> #include<cmath> using namespace std; long long int f[2001], k[2001]; int main() { int l, n; while (cin >> l >> n) { int minid = 0; int min = 9999; 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++) { long long sum = 0; for (int j = 0;j < n;j++) { int s = abs(i - k[j]); long long harm = f[j] - s; if (harm < 0) harm = 0; sum += harm; } if (sum < min) { min = sum; minid = i; } } cout << minid << endl; cout << min<< endl; } } |
Double click to view unformatted code.