Submission #1386443

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

const int maxx = 1e5 + 20;

int ans = 0, n, a[maxx], b[maxx];
map<int, int> m;
vector<int> v1, v2;

int main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n;
	for(int i = 0; i < n; i++) cin >> a[i], b[i] = a[i];
	sort(b, b + n);
	for(int i = 0; i < n; i++)	m[b[i]] = i;
	for(int i = 0; i < n; i++) a[i] = m[a[i]];//, cout << a[i] << " " ;
	for(int i = 0; i < n; i += 2) v1.push_back(a[i]), v2.push_back(i);
	sort(v1.begin(), v1.end());
	for(int i = 0; i < v1.size(); i++) ans += (abs(v1[i] - v2[i]));
	cout << ans;
	return 0;
}

Submission Info

Judge Result