703. Kth Largest Element in a Stream

Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element.

Your KthLargest class will have a constructor which accepts an integer k and an integer array nums, which contains initial elements from the stream. For each call to the method KthLargest.add, return the element representing the kth largest element in the stream.

Example:

int k = 3;
int[] arr = [4,5,8,2];
KthLargest kthLargest = new KthLargest(3, arr);
kthLargest.add(3);   // returns 4
kthLargest.add(5);   // returns 5
kthLargest.add(10);  // returns 5
kthLargest.add(9);   // returns 8
kthLargest.add(4);   // returns 8

Note:
You may assume that nums' length ≥ k-1 and k ≥ 1.

题意：在数据流中寻找第K大的元素。

解法：维护一个始终有K个元素的小顶堆，堆顶元素即为第K大元素。当新的元素添加进来时，如果小于堆顶元素，不予处理。如果大于堆顶元素，则移除堆顶元素，并将新元素添加进来。

class KthLargest {
public:
    KthLargest(int k, vector<int>& nums)
    {
        len = k;
        for (int i = 0; i < nums.size(); i++)
        {
            add(nums[i]);
        }
    }

    int add(int val) {
        if (log.size() < len)
        {
            log.push(val);
        }
        else
        {
            int temp = log.top();
            if (val > temp)
            {
                log.pop();
                log.push(val);
            }
        }
        return log.top();
    }
private:
    priority_queue<int, vector<int>, greater<int> > log;  //小顶堆
    int len;
};

/**
 * Your KthLargest object will be instantiated and called as such:
 * KthLargest* obj = new KthLargest(k, nums);
 * int param_1 = obj->add(val);
 */