题解 | #特殊排序#
特殊排序
http://www.nowcoder.com/practice/57f0f528bff149be9580af66f6292430
#include<iostream> #include<cstdio> #include<algorithm> using namespace std; int main(){ int n; int array[1000]; while(scanf("%d\n",&n)!=EOF){ for(int i=0;i<n;++i){ scanf("%d ",&array[i]); } sort(array,array+n); cout<<array[n-1]<<endl; --n; if(n){ for(int i=0;i<n;++i){ cout<<array[i]<<" "; } } else{ cout<<-1; } cout<<endl; } return 0; }