solution
- 把多条绳子连接成一条,因为对折会缩小绳子长度,则从最短的绳子开始连接,以实现最终的绳子最长
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n, a[10010], ans;
scanf("%d", &n);
for(int i = 1; i <= n; i++){
scanf("%d", a + i);
}
sort(a + 1, a + n + 1);
for(int i = 1; i <= n; i++){
if(i == 1) ans = a[i];
else ans = (ans + a[i]) / 2;
}
printf("%d", ans);
return 0;
}