[贪心] BZOJ 2697 特技飞行

贪心地，每次把最大的放在两端

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;

inline char nc()
{
	static char buf[100000],*p1=buf,*p2=buf;
	if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
	return *p1++;
}

inline void read(int &x)
{
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

int n,K,ans,c[305];

int main()
{
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	read(n); read(K);
	for(int i=1;i<=K;i++) read(c[i]);
	sort(c+1,c+K+1);
	int l=1,r=n;
	for(int i=K;i && l<r;i--,l++,r--)
	    ans+=(r-l)*c[i];
	printf("%d\n",ans);
	return 0;
}