1
class Solution {
2
 public:
3
  int partitionArray(vector<int> &nums, int k) {
4
    int n(size(nums)), res(0);
5
    sort(begin(nums), end(nums));
6

7
    for (int start = 0, next = 0; start < n;) {
8
      while (next < n and nums[next] - nums[start] <= k) next++;
9
      start = next;
10
      res++;
11
    }
12
    return res;
13
  }
14
};