# CF1189 B. Number Circle

/*program from Wolfycz*/
#include<map>
#include<cmath>
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define Fi first
#define Se second
#define ll_inf 1e18
#define MK make_pair
#define sqr(x) ((x)*(x))
#define pii pair<int,int>
#define int_inf 0x7f7f7f7f
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
inline char gc(){
static char buf[1000000],*p1=buf,*p2=buf;
}
template<typename T>inline T frd(T x){
int f=1; char ch=gc();
for (;ch<'0'||ch>'9';ch=gc())	if (ch=='-')    f=-1;
for (;ch>='0'&&ch<='9';ch=gc())	x=(x<<1)+(x<<3)+ch-'0';
return x*f;
}
int f=1; char ch=getchar();
for (;ch<'0'||ch>'9';ch=getchar())	if (ch=='-')	f=-1;
for (;ch>='0'&&ch<='9';ch=getchar())	x=(x<<1)+(x<<3)+ch-'0';
return x*f;
}
inline void print(int x){
if (x<0)	putchar('-'),x=-x;
if (x>9)	print(x/10);
putchar(x%10+'0');
}
const int N=1e5;
int A[N+10],B[N+10];
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
sort(A+1,A+1+n);
reverse(A+1,A+1+n);
if (A[1]>=A[2]+A[3]){
printf("NO\n");
return 0;
}
for (int i=1;i<=n;i+=2)	B[(i+1)>>1]=A[i];

for (int i=n,j=2;j<=n;i--,j+=2)	B[i]=A[j];

printf("YES\n");
for (int i=1;i<=n;i++)	printf("%d%c",B[i],i==n?'\n':' ');
return 0;
}

posted @ 2021-07-07 17:16  Wolfycz  阅读(14)  评论(0编辑  收藏  举报