我调了一个钟的平衡树

然后想弄个暴力对拍, 然后O($n^2)$ AC了, 太玄学了吧, n出到20000都不至于吧?

AC代码：

#include <bits/stdc++.h>
using namespace std;
int n, mps[100005], ansn;
int main() {
	scanf("%d", &n);
	for(int i = 1;i <= n;i++) {
		scanf("%d", &mps[i]);
		if(i == 1) ansn += mps[i];
		else {
			int minn = 2147483647;
			for(int j = 1;j <= i - 1;j++) {
				minn = min(minn, abs(mps[j] - mps[i]));
			}
			ansn += minn;
		}
	}
	cout << ansn << endl;
}