> For the complete documentation index, see [llms.txt](https://dfine.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://dfine.gitbook.io/leetcode/703.kth_largest_element_in_a_stream.md).

# 703.Kth Largest Element in a Stream

**703.Kth Largest Element in a Stream**

难度:Easy

> 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.
```

使用最小堆完成，不过需要注意length< k的情况。这里补`INT_MIN`。

```
class KthLargest {
priority_queue<int,vector<int>,greater<int>>kth;
public:
    KthLargest(int k, vector<int>& nums) {
       
      
        for(auto n:nums)
            kth.push(n);
        for(int i=nums.size();i<k;i++)
            kth.push(INT_MIN);
        for(int i=0;i<int(nums.size())-k;i++)
          kth.pop();

    }
    
    int add(int val) {
        if(val>kth.top())
           {
               kth.pop();
               kth.push(val);
           }
     
        return kth.top();
    }
};

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

```

> 执行用时 :64 ms, 在所有 C++ 提交中击败了89.78%的用户\
> 内存消耗 :19.3 MB, 在所有 C++ 提交中击败了87.57%的用户


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://dfine.gitbook.io/leetcode/703.kth_largest_element_in_a_stream.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.