Submission #3812368

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>

int main() {
  int N, K, h;
  std::cin >> N >> K;
  std::vector<int> heights;
  for (int i = 0; i < N; ++i) {
    std::cin >> h;
    heights.push_back(h);
  }
  std::sort(heights.begin(), heights.end());
  int min = INT32_MAX;
  for (int i = K-1; i < heights.size(); ++i) {
    if (heights[i] - heights[i-(K-1)] < min)
      min = heights[i] - heights[i-(K-1)];
  }
  std::cout << min << std::endl;
}

Submission Info

Submission Time
Task C - Christmas Eve
User wakanapo
Language C++14 (GCC 5.4.1)
Score 300
Code Size 481 Byte
Status AC
Exec Time 47 ms
Memory 892 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 10
Set Name Test Cases
Sample a01, a02
All a01, a02, b03, b04, b05, b06, b07, b08, b09, b10
Case Name Status Exec Time Memory
a01 AC 1 ms 256 KiB
a02 AC 1 ms 256 KiB
b03 AC 1 ms 256 KiB
b04 AC 45 ms 892 KiB
b05 AC 47 ms 892 KiB
b06 AC 47 ms 892 KiB
b07 AC 47 ms 892 KiB
b08 AC 47 ms 892 KiB
b09 AC 47 ms 892 KiB
b10 AC 47 ms 892 KiB