信息学奥赛一本通高手训练1679：子集

题目

代码

#include<bits/stdc++.h>
template<class T>
inline void read(T & res)
{
	char ch;
	while(ch=getchar(),! isdigit(ch));
	res=ch^48;
	while(ch=getchar(),isdigit(ch))res=res*10+ch-48;
}
typedef long long ll;
const int N=2e5+5;
const double eps=1e-8;
int a[N],n;
double ans;
ll sum[N];
template<class T>
inline T Min(T x,T y)
{
	return x<y? x:y; 
}
template<class T>
inline void CkMax(T & x,T y)
{
	x<y? x=y :0;
}
inline bool cmp(const int & x,const int & y)
{
	return x>y;
}
inline double ask(int k,int m)
{
	return(sum[m]+sum[k+m]-sum[k-1])/(double)(m<<1|1);
}
int main()
{
	read(n);
	for(int i=1;i<=n;++i)read(a[i]);
	std::sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;++i)sum[i]=sum[i-1]+a[i];
	for