HD 1425 sort

                                           sort

                                              Time Limit: 6000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
                                              Total Submission(s): 34087    Accepted Submission(s): 10111
********************************************************************************************************************************************************************
********************************************************************************************************************************************************************

Problem Description

给你n个整数，请按从大到小的顺序输出其中前m大的数。

------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 

------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 

Input

每组测试数据有两行，第一行有两个数n,m(0<n,m<1000000)，第二行包含n个各不相同，且都处于区间[-500000,500000]的整数。

 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 

Output

对每组测试数据按从大到小的顺序输出前m大的数。

 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 
Sample Input

  
  

   
   5 3
3 -35 92 213 -644
  
  

------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------  

Sample Output

  
  

   
   213 92 3


   
   

    
    -------------------------------------------------------------------------------------------------------------------- 
   
   
   
   

    
    -------------------------------------------------------------------------------------------------------------------- 
   
   

   
   AC代码
  
  
  
  

   
   #include<stdio.h>
#include<string.h>
#include<algorithm>//sort排序用到三个头文件
#include<iostream>//sort排序用到三个头文件

using namespace std;//sort排序用到三个头文件

int a[1000000];
int main()
{
 int f,i,n,m;
 while(scanf("%d %d",&m,&n)!=EOF)
 {
    for(i=0;i<m;i++)
    scanf("%d",&a[i]);
    sort(a,a+m);
    f=m-1;
    printf("%d",a[f]);
    f-=1;
    for(i=n;i>1;i--)
    {
      printf(" %d",a[f]);
      f--;
    }
    printf("\n");
    }
}