all done but copied solution for grid paths: dfs with prune. very tedious

CSES - CSES Problem Set/Apple_Division.cpp

@@ -0,0 +1,26 @@
+//  Apple Division
+
+#include<bits/stdc++.h>
+
+using namespace std;
+using ll = long long;
+
+ll get_min(vector<ll> &p, int idx, ll sum) {
+    if (idx == p.size()) {
+        ll total_sum = 0;
+        for (auto e: p) total_sum += e;
+        sum *= 2;
+        return abs(sum - total_sum);
+    }
+    ll with_idx = get_min(p, idx+1, sum+p[idx]);
+    ll without_idx = get_min(p, idx+1, sum);
+    return min(with_idx, without_idx);
+}
+
+int main() {
+    int n; cin >> n;
+    vector<ll> input(n);
+    for (auto &e : input) cin >> e;
+    cout << get_min(input, 0, 0) << endl;
+    return 0;
+}