# coding=utf-8
import unittest

"""215. Kth Largest Element in an Array
https://leetcode.com/problems/kth-largest-element-in-an-array/description/

Find the **k** th largest element in an unsorted array. Note that it is the
kth largest element in the sorted order, not the kth distinct element.

**Example 1:**

    
    
    **Input:** [3,2,1,5,6,4] and k = 2
    **Output:** 5
    

**Example 2:**

    
    
    **Input:** [3,2,3,1,2,4,5,5,6] and k = 4
    **Output:** 4

**Note:**  
You may assume k is always valid, 1  ≤ k ≤ array's length.


Similar Questions:
  Wiggle Sort II (wiggle-sort-ii)
  Top K Frequent Elements (top-k-frequent-elements)
  Third Maximum Number (third-maximum-number)
"""


class Solution(object):
    def findKthLargest(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: int
        """
        

    def test(self):
        pass


if __name__ == "__main__":
    unittest.main()
