solutions: 337A

This commit is contained in:
Muhammad Nauman Raza 2025-01-21 09:41:16 +00:00
parent d5331cdee9
commit 99cdfebdd9
Signed by: devraza
GPG key ID: 91EAD6081011574B

View file

@ -0,0 +1,30 @@
use std::io;
fn main() {
let mut s = String::new();
io::stdin().read_line(&mut s).unwrap();
let a = s.trim().split_whitespace().map(|s| s.parse::<u64>().unwrap()).collect::<Vec<u64>>();
let n: usize = a[0] as usize;
let m: usize = a[1] as usize;
let mut s = String::new();
io::stdin().read_line(&mut s).unwrap();
let mut f = s.trim().split_whitespace().map(|s| s.parse::<u64>().unwrap()).collect::<Vec<u64>>();
f.sort();
let mut minimum = f[f.len()-1]-f[0];
for i in 0_usize..(m-n)+1 {
let subset = &f[i..(i+n)];
let current = subset[subset.len()-1]-subset[0];
if current < minimum {
minimum = current;
}
}
println!("{}", minimum);
}