摘要： #include <cstdio>#include<iostream>#include<stdlib.h>using namespace std;int n;int QuickSort(int *a,int left,int right);int search(int *a,int i,int j,int k);void swap(int *a,int *b){ int temp; temp=*a; *a=*b; *b=temp;}int main(){ int k_max; int a[100]; cin >> n ; for (int i = 阅读全文