sort
Time Limit: 6000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 35608 Accepted Submission(s): 10546
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请用VC/VC++提交HintHint
Author
LL
Source
Recommend
解析:我用读入优化超时,改成scanf居然就过了,至今没搞懂为什么?
这是一个200ms内的题解:http://blog.csdn.net/murmured/article/details/17616113
代码:
#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
using namespace std;
const int maxn=1e6;
int a[maxn+10];
int getin()
{
int ans=0;char tmp;bool sign=0;
while(!isdigit(tmp=getchar()) && tmp!='-');
if(tmp=='-')sign=1,tmp=getchar();
do ans=(ans<<3)+(ans<<1)+tmp-'0';
while(isdigit(tmp=getchar()));
return sign?-ans:ans;
}
bool cmp(int x,int y)
{
return x>y;
}
int main()
{
//freopen("1.in","r",stdin);
int n,m,i;
while(scanf("%d%d",&n,&m)!=EOF)
{
//for(i=1;i<=n;i++)a[i]=getin();
for(i=1;i<=n;i++)scanf("%d",&a[i]);
sort(a+1,a+n+1,cmp);
for(i=1;i<m;i++)printf("%d ",a[i]);
printf("%d\n",a[m]);
}
return 0;
}