absolute-difference-between-maximum-and-minimum-k-elements

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> and an integer <code>k</code>.

Find the absolute difference between:

<ul>
	<li>the sum of the <code>k</code> largest elements in the array; and</li>
	<li>the sum of the <code>k</code> smallest elements in the array.</li>
</ul>

Return an integer denoting this difference.

&nbsp;
Example 1:

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

Output: 5

Explanation:

<ul>
	<li>The <code>k = 2</code> largest elements are 4 and 5. Their sum is <code>4 + 5 = 9</code>.</li>
	<li>The <code>k = 2</code> smallest elements are 2 and 2. Their sum is <code>2 + 2 = 4</code>.</li>
	<li>The absolute difference is <code>abs(9 - 4) = 5</code>.</li>
</ul>
</div>

Example 2:

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

Output: 0

Explanation:

<ul>
	<li>The largest element is 100.</li>
	<li>The smallest element is 100.</li>
	<li>The absolute difference is <code>abs(100 - 100) = 0</code>.</li>
</ul>
</div>

&nbsp;
Constraints:

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