#include<algorithm> class Solution { public: //快速排序 int findKth(vector<int> a, int n, int K) { return quickSelect(a,0,n - 1,n - K); } inline int randomPartition(vector<int>& a,int low,int high){ int pivot = rand() % (high - low + 1) + low; ...