Create 1070.结绳 （25 分）.cpp

PAT/PAT-B/CPP/1070.结绳 （25 分）.cpp

@@ -0,0 +1,17 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+using namespace std;
+int main() {
+    int n;
+    scanf("%d", &n);
+    vector<int> v(n);
+    for (int i = 0; i < n; i++)
+        scanf("%d", &v[i]);
+    sort(v.begin(), v.end());
+    int result = v[0];
+    for (int i = 1; i < n; i++)
+        result = (result + v[i]) / 2;
+    printf("%d", result);
+    return 0;
+}