-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMaxMin.cs
56 lines (44 loc) · 1.37 KB
/
MaxMin.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
using System.CodeDom.Compiler;
using System.Collections.Generic;
using System.Collections;
using System.ComponentModel;
using System.Diagnostics.CodeAnalysis;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Reflection;
using System.Runtime.Serialization;
using System.Text.RegularExpressions;
using System.Text;
using System;
class Result
{
public static int maxMin(int k, List<int> arr) {
arr.Sort();
var bestUnfairness = int.MaxValue;
for (var i = 0; i < arr.Count - k + 1; i++) {
var unfairness = arr[i + k - 1] - arr[i];
if (unfairness < bestUnfairness) bestUnfairness = unfairness;
}
return bestUnfairness;
}
}
class Solution
{
public static void Main(string[] args)
{
TextWriter textWriter = new StreamWriter(@System.Environment.GetEnvironmentVariable("OUTPUT_PATH"), true);
int n = Convert.ToInt32(Console.ReadLine().Trim());
int k = Convert.ToInt32(Console.ReadLine().Trim());
List<int> arr = new List<int>();
for (int i = 0; i < n; i++)
{
int arrItem = Convert.ToInt32(Console.ReadLine().Trim());
arr.Add(arrItem);
}
int result = Result.maxMin(k, arr);
textWriter.WriteLine(result);
textWriter.Flush();
textWriter.Close();
}
}