Problem:
Score : 600 points

Problem Statement

You are given an integer sequence A of length N and an integer K.
You will perform the following operation on this sequence Q times:

Choose a contiguous subsequence of length K, then remove the smallest element among the K elements contained in the chosen subsequence (if there are multiple such elements, choose one of them as you like).

Let X and Y be the values of the largest and smallest element removed in the Q operations. You would like X-Y to be as small as possible.
Find the smallest possible value of X-Y when the Q operations are performed optimally.

Constraints

1 \leq N \leq 2000

1 \leq K \leq N

1 \leq Q \leq N-K+1

1 \leq A_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K Q
A_1 A_2 ... A_N

Output

Print the smallest possible value of X-Y.

Sample Input 1

5 3 2
4 3 1 5 2

Sample Output 1

1

In the first operation, whichever contiguous subsequence of length 3 we choose, the minimum element in it is 1.
Thus, the first operation removes A_3=1 and now we have A=(4,3,5,2).
In the second operation, it is optimal to choose (A_2,A_3,A_4)=(3,5,2) as the contiguous subsequence of length 3 and remove A_4=2.
In this case, the largest element removed is 2, and the smallest is 1, so their difference is 2-1=1.

Sample Input 2

10 1 6
1 1 2 3 5 8 13 21 34 55

Sample Output 2

7

Sample Input 3

11 7 5
24979445 861648772 623690081 433933447 476190629 262703497 211047202 971407775 628894325 731963982 822804784

Sample Output 3

451211184

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

fn argsort<T: std::cmp::Ord + std::marker::Copy>(v: &Vec<T>) -> Vec<usize> {
    let mut sort_v = Vec::new();
    for i in 0..v.len() {
        sort_v.push((v[i], i));
    }
    sort_v.sort();
    sort_v.iter().map(|x| x.1).collect::<Vec<usize>>()
}

fn construct_usables(k: usize, min_candidate_a: u64, a: &Vec<u64>) -> Vec<u64> {
    let mut usables = Vec::new();

    let mut is_seeking = false;
    let mut start_seeking_index = 0usize;

    for j in 0..a.len() {
        if a[j] >= min_candidate_a {
            if !is_seeking {
                is_seeking = true;
                start_seeking_index = j;
            }
        }
        if is_seeking && (a[j] < min_candidate_a || j == a.len() - 1) {
            let mut end_idx = j;
            if j == a.len() - 1 {
                end_idx += 1;
            }
            is_seeking = false;
            if end_idx - start_seeking_index < k {
                continue;
            }

            let mut pocket_values = Vec::new();
            for ii in start_seeking_index..end_idx {
                pocket_values.push(a[ii]);
            }
            pocket_values.sort();

            let width = end_idx - start_seeking_index;
            for ii in 0..width + 1 - k {
                usables.push(pocket_values[ii]);
            }
        }
    }
    usables.sort();
    usables
}

fn main() {
    let v = read_vec::<usize>();
    let (n, k, q) = (v[0], v[1], v[2]);
    let a = read_vec::<u64>();

    let mut ans = std::u64::MAX;
    for i in 0..n {
        let min_candidate_a = a[i];
        let usables = construct_usables(k, min_candidate_a, &a);
        if usables.len() >= q {
            // assert_eq!(usables[0], min_candidate_a);
            ans = min(ans, usables[q - 1] - min_candidate_a);
        }
    }
    println!("{}", ans);
}