sda-monsters-task

import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int x = sc.nextInt();
        int[] arr = new int[n];
        for(int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }
        System.out.println(getMinBlasterUsage(arr, n, x));
    }

    static int getMinBlasterUsage(int[] arr, int n, int x) {

        int maxPosition = -1;
        for(int num : arr) {
            if(num > maxPosition) {
                maxPosition = num;
            }
        }
        boolean[] countUnique = new boolean[maxPosition];
        for(int num : arr) {
            countUnique[num] = true;
        }
        int[] sorted = new int[n];
        for (int i = 0, j = 0; i < maxPosition; i++) {
            if(countUnique[i]) {
                sorted[j++] = i;
            }
        }
        int blastCount = 1;
        for (int i = n - 1; i >= 0; i--) {
            if (x * blastCount > sorted[i]) {
                break;
            }
            blastCount++;
        }
        return blastCount;
    }
}