//19:18~19:38
#include<bits/stdc++.h>
using namespace std;
int main()
{
vectorall;
int N;
cin >> N;
int a;
for (int i = 0; i < N; i++)
{
cin >> a;
all.push_back(a);
}
sort(all.begin(), all.end());//从最短的开始串联,这样串联的长度最长
double mildle = all[0];
for (int i = 1; i < N ; i++)
{
mildle = (mildle + all[i]) / 2;
}
cout <<(int)mildle;
return 0;
}
PAT 乙级 1070 结绳 (25分)
最新推荐文章于 2024-07-19 22:36:19 发布