aboutsummaryrefslogtreecommitdiff
path: root/store/works/life/algorithm-contest-2/solution/2.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'store/works/life/algorithm-contest-2/solution/2.cpp')
-rw-r--r--store/works/life/algorithm-contest-2/solution/2.cpp41
1 files changed, 41 insertions, 0 deletions
diff --git a/store/works/life/algorithm-contest-2/solution/2.cpp b/store/works/life/algorithm-contest-2/solution/2.cpp
new file mode 100644
index 0000000..4410da0
--- /dev/null
+++ b/store/works/life/algorithm-contest-2/solution/2.cpp
@@ -0,0 +1,41 @@
+#define _CRT_SECURE_NO_WARNINGS
+#include <iostream>
+#include <cstdio>
+#include <cstring>
+#include <algorithm>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <map>
+#include <cmath>
+#include <unordered_map>
+#include <unordered_set>
+#include <string>
+#include <sstream>
+#include <climits>
+#define x first
+#define y second
+#define pub push_back
+#define mp make_pair
+#define ll long long
+using namespace std;
+typedef pair<int, int> PII;
+
+const int MAXN = 1e5 + 5;
+int n, a[MAXN];
+
+int main(void) {
+ cin >> n;
+ for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
+ sort(a + 1, a + 1 + n);
+
+ int l = 1, r = n;
+ ll ans = 0;
+
+ while (l < r) {
+ ans += (a[r--] - a[l++]);
+ }
+ cout << ans;
+ return 0;
+} \ No newline at end of file