int minimumGroups(vector<int> awards, int k)
{
sort(awards.begin(), awards.end());
int count = 1;
int flag = 0;
for (int i = 0; i < awards.size() - 1; i++)
{
for (int j = i + 1; j < awards.size(); j++)
{
if ((awards[j] - awards[i]) > k)
{
count++;
flag = 1;
i = j;
}
else
{
flag = 0;
}
}
}
return count;
}