class Solution { public: int findKth(vector<int> a, int n, int K) { // write code here if(K <= 0)return -1; vector<int> vecKth; for(int i = 0; i < a.size(); i++) { if(vecKth.size() < K) { vecKth.push_back(a[i]); } else { int nMinNumIndex = 0; int nMinNum = vecKth[0]; for(int j = 1; j < vecKth.size(); j++) { if(vecKth[j] < nMinNum) { nMinNum = vecKth[j]; nMinNumIndex = j; } } if(nMinNum < a[i]) { int nTmp = vecKth[nMinNumIndex]; vecKth[nMinNumIndex] = a[i]; a[i] = nTmp; } } } for(int i = 0; i < vecKth.size() - 1; i++) { for(int j = 0; j < vecKth.size() - 1 - i; j++) { if(vecKth[j] < vecKth[j+1]) { int nTmp = vecKth[j]; vecKth[j] = vecKth[j+1]; vecKth[j+1] = nTmp; } } } return vecKth[K-1]; } };