Tikut

input/code.cpp: In function 'int main()':
input/code.cpp:58:13: warning: unused variable 'sum' [-Wunused-variable]
   58 |         int sum = 0;
      |             ^~~
input/code.cpp:68:13: warning: unused variable 'MIN' [-Wunused-variable]
   68 |         int MIN = numbers[0];
      |             ^~~

#include <iostream>
#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>

using namespace std;

int func_max(int a, int b) {
	if (a < b) {
		return b;
	}
	return a;
}

int func_min(int a, int b) {
	if (a < b) {
		return a;
	}
	return b;
}

int recursion(vector<int> numbers, vector<int> splitNumbers, vector<double> splitSize, int m) {
	int n = splitNumbers.size();
	int minDif = 9999999;
	if (m == 0) {
		int min = 999999;
		int max = 0;
		for (int i = 0; i < n; i++) {
			if (min > floor(splitSize[i])) {
				min = floor(splitSize[i]);
			}
			if (max < ceil(splitSize[i])) {
				max = ceil(splitSize[i]);
			}
		}
		return max - min;
	}
	for (int i = 0; i < n;i++) {
		splitNumbers[i] += 1;
		splitSize[i] = double(numbers[n - 1 - i]) / (1 + splitNumbers[i]);
		int dif = recursion(numbers, splitNumbers, splitSize, m - 1);
		splitNumbers[i] -= 1;
		splitSize[i] = double(numbers[n - 1 - i]) / (1 + splitNumbers[i]);
		if (dif < minDif) {
			minDif = dif;
		}
	}
	return minDif;
}

int main()
{
	std::vector<int> numbers;
	int n, m;
	int number;
	std::cin >> n >> m;
	int sum = 0;
	for (int i = 0; i < n; i++) {
		std::cin >> number;
		numbers.push_back(number);

	}
	sort(numbers.begin(), numbers.end());

	std::vector<int> splittingNumbers;
	std::vector<double> splittingSize;
	int MIN = numbers[0];
	for (int j = n - 1; j >= 0; j--) {
		splittingNumbers.push_back(0);
		splittingSize.push_back(numbers[j]);
	}
	for (int i = 0; i < m; i++) {
		int dif = recursion(numbers, splittingNumbers, splittingSize, i + 1);
		if (i < m - 1) {
			std::cout << dif << " ";
		}
		else {
			std::cout << dif;

		}
	}
}

Test 1

Group: 1, 3, 4, 5, 6

Verdict: ACCEPTED

Test 2

Group: 1, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 6

Verdict: TIME LIMIT EXCEEDED