第K大元素

 1 class Solution {
 2 public:
 3     /*
 4      * param k : description of k
 5      * param nums : description of array and index 0 ~ n-1
 6      * return: description of return
 7      */
 8     int kthLargestElement(int k, vector<int> nums) {
 9         // write your code here
10         for(int i=0;i<k;i++)
11             for(int j=0;j<nums.size()-i-1;j++)
12             {
13                 if(nums[j]>nums[j+1])
14                 {
15                     int temp=nums[j];
16                     nums[j]=nums[j+1];
17                     nums[j+1]=temp;
18                 }
19             }
20         return nums[nums.size()-k];
21     }
22 };