Algorithm:快速排序

#include<iostream>
using namespace std;
int a[50];
void qsort(int s,int e){
	if(s<=e){
		int x=a[s];
		int i=s,j=e;
		while(i<j){
			while(i<j&&a[j]>=x) --j;
			while(i<j&&a[i]<=x) ++i;
			int tmp=a[i]; a[i]=a[j];a[j]=tmp;
		}
		a[s]=a[i];
		a[i]=x;
		qsort(s,i-1);
		qsort(i+1,e);
	}
}

int main(){
	int n;
	cin>>n;
	for(int i=0; i<n; ++i){
		cin>>a[i];
	}
	qsort(0,n-1);
	for(int i=0;i<n;++i)
		cout<<a[i]<<" ";
		cout<<endl;
	int k=3;
	cout<<a[k-1]<<endl;  //第k大 
	cout<<a[n-k]<<endl;  //第k小 
	return 0;
}