#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int>v;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
v.push_back(l);
}
sort(v.begin(), v.end());
//1 3 4 10 12 13 15 15
//0 1 2 3 4 5 6 7
int i;
for (i = 1; i < n; i++) {
v[i] = (v[i - 1] + v[i]) / 2;
//(v[0]+v[1])/2
//v[1]=(v[0]+v[1])/2
//(v[1]+v[2])/2==[(v[0]+v[1])/2+v[2]]/2
//v[2]=(v[1]+v[2])/2==[(v[0]+v[1])/2+v[2]]/2
}
cout << v[i-1] << endl;
return 0;
}
|贪心 合成大西瓜(x)|1125 Chain the Ropes (25分)
最新推荐文章于 2022-08-29 07:05:18 发布