Files
OI-source/history_source/信息学奥赛一本通/2.7.2.cpp
2023-08-03 09:22:52 +08:00

37 lines
761 B
C++

#include<iostream>
using namespace std;
template<class T_fsort>
void fsort(T_fsort *left,T_fsort *right,bool (*cmp)(T_fsort a,T_fsort b),T_fsort *k)
{
if(right-left<=1) return;
unsigned int len=right-left;
fsort(left,left+len/2,cmp,k);
fsort(left+len/2,right,cmp,k+len/2);
int i=0,j=len/2,n=0;
while(i<len/2&&j<len)
{
if(cmp(left[i],left[j])) k[n++]=left[i++];
else k[n++]=left[j++];
}
while(i<len/2) k[n++]=left[i++];
while(j<len) k[n++]=left[j++];
for(int i=0;i<len;i++) left[i]=k[i];
}
bool cmp(int a,int b)
{
return (a>=b);
}
int main()
{
ios::sync_with_stdio(0);
int n,k;
cin>>n;
int num[n],f[n];
for(int i=0;i<n;i++) cin>>num[i];
fsort(num,num+n,cmp,f);
cin>>k;
for(int i=0;i<k;i++) cout<<num[i]<<'\n';
cout<<flush;
return 0;
}