第一次写快排的题,,留下做个模板。这道题用sort也是可以过的。题目:
sort
Time Limit: 6000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15172 Accepted Submission(s): 4363
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 <iostream>
#include <string.h>
#include <cstdio>
using namespace std;
const int N=1000005;
int num[N];
int partition(int low,int high){
int i=low,j=high,key=num[low];
while(i<j){
while(i<j&&num[j]>key) --j;
int t=num[i]; num[i]=num[j];num[j]=t;
while(i<j&&num[i]<key) ++i;
t=num[i];num[i]=num[j];num[j]=t;
}
return i;
}
void quick_sort(int low,int high){
if(low<high){
int x=partition(low,high);
quick_sort(low,x-1);
quick_sort(x+1,high);
}
}
int main(){
//freopen("11.txt","r",stdin);
int n,m;
while(~scanf("%d%d",&n,&m)){
for(int i=0;i<n;++i)
scanf("%d",&num[i]);
quick_sort(0,n-1);
for(int i=n-1;i>n-m;--i)
printf("%d ",num[i]);
printf("%d",num[n-m]);
printf("\n");
}
return 0;
}