sort
Time Limit: 6000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 27742 Accepted Submission(s): 8381
5 3 3 -35 92 213 -644
213 92 3#include<stdio.h> #include<string.h> #include<algorithm>
//int a[1000005]; using namespace std; bool cmp(int a,int b){ return a>b; } int a[1000005]; int main() { int n,m,i; memset(a,0,sizeof(a)); while(scanf("%d %d",&n,&m)!=EOF) { for(i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n,cmp); // for(i=0;i<m;i++) // 有此句会先输出m个a[0],再输出后面的m-1个数 printf("%d",a[0]); for(i=1;i<m;i++) printf(" %d",a[i]); printf("\n"); } return 0; }