Submission #1965725

---

Source Code Expand

#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;


typedef long long ll;

ll d;

ll n;

ll m;

vector<ll> dis;

int main()
{
	cin >> d;
	cin >> n;
	cin >> m;

	dis.resize(n + 1);

	dis[0] = 0;

	for(int i = 1;i <= n - 1;i++) cin >> dis[i];
	dis[n] = d;
	sort(dis.begin(),dis.end());

	ll k;

	ll result = 0;

	for(int c = 0;c < m;c++)
	{
		cin >> k;

		auto low = lower_bound(dis.begin(),dis.end(),k);

		auto up = upper_bound(dis.begin(),dis.end(),k);

		if(k == (*low)) continue;

		--low;

		ll l = (*low);
		ll r = (*up);

		result += min(k - l, r - k);
	}

	cout << result << endl;
	return 0;
}

Submission Info

Judge Result