chore(store): move everything to store.

1 files changed, 0 insertions, 41 deletions

diff --git a/works/life/algorithm-contest-2/solution/2.cpp b/works/life/algorithm-contest-2/solution/2.cpp
deleted file mode 100644
index 4410da0..0000000
--- a/works/life/algorithm-contest-2/solution/2.cpp
+++ /dev/null
@@ -1,41 +0,0 @@
-#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