count-elements-with-at-least-k-greater-values

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code> of length <code>n</code> and an integer <code>k</code>.

An element in <code>nums</code> is said to be qualified if there exist at least <code>k</code> elements in the array that are strictly greater than it.

Return an integer denoting the total number of qualified elements in <code>nums</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [3,1,2], k = 1

Output: 2

Explanation:

The elements 1 and 2 each have at least <code>k = 1</code> element greater than themselves. 
​​​​​​​No element is greater than 3. Therefore, the answer is 2.
</div>

Example 2:

<div class="example-block">
Input: nums = [5,5,5], k = 2

Output: 0

Explanation:

Since all elements are equal to 5, no element is greater than the other. Therefore, the answer is 0.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n == nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 109</code></li>
	<li><code>0 &lt;= k &lt; n</code></li>
</ul>

Weekly Contest 478

weekly-contest-478

countElements

Senior

Count Elements With at Least K Greater Values

Array

Binary Search

Divide and Conquer

Sorting

Quickselect

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs