WHU-Problem 1152 - Feli 的糖果 寻找第K小数（计数排序，与快速排序）

大数组最好作全局变量，否则内存不够，会出现段错误。

计数排序比快速排序时间效率更高一些。

计数排序：

#include<stdio.h>
int num[10000000], c[10000000];
int main(){
	int n, k;
	while (scanf_s("%d%d", &n, &k)!=EOF){
		int max = 0;
		for (int i = 0; i < n; i++){
			scanf_s("%d", &num[i]);
			if (max < num[i])   max = num[i];
		}

		for (int i = 0; i <= max; i++){
			c[i] = 0;
		}

		for (int i = 0; i < n; i++){
			c[num[i]]++;
		}

		for (int i = 1; i <= max; i++){
			c[i] += c[i - 1];
			if (c[i] >= k)
			{
				printf("%d\n", i);
				break;
			}
		}
	}
}

快速排序：

#include<iostream>
#include<stdio.h>
using namespace std;
int num[5000000];

int select(int a[], int p, int q, int k){
	if (p == q)  return  a[q];
	int tmp = a[p];
	int i = p, j = q;
	while (i <j){
		while(i<j&&tmp <= a[j]) 
			j--;
		a[i] = a[j];

		while(i<j&&a[i] <= tmp) 
			i++;
		a[j] = a[i];
	}
	a[i] = tmp;
	int h = i - p + 1;
	if (h == k) return tmp;
	else if (h < k)
		select(a, i + 1, q, k - h);
	else if (h>k)
		select(a, p, i - 1, k);
}

int main(){
	int n, k;
	//cin >> n >> k;
	while (scanf_s("%d%d", &n, &k) != EOF){
		for (int i = 0; i < n; i++){
				cin >> num[i];
		}
		int ans = select(num, 0, n - 1, k);
		cout << ans << endl;
		}
	}