Tikut

input/code.cpp: In function 'int main()':
input/code.cpp:82:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<double>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |                 for (int t = 0; t < splittingSize.size(); t++) {
      |                                 ~~^~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:88:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<double>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |                 for (int t = 0; t < splittingSize.size(); t++) {
      |                                 ~~^~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:60:13: warning: unused variable 'sum' [-Wunused-variable]
   60 |         int sum = 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;
	n = 10;
	m = 5;
	int sum = 0;
	for (int i = 0; i < n; i++) {
		//std::cin >> number;
		number = rand() % 200 + 1;

		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);
		int max = 0;
		int secLarg = 0;
		int index = -1;
		for (int t = 0; t < splittingSize.size(); t++) {
			if (splittingSize[t] > max) {
				max = ceil(splittingSize[t]);
			}
		}
		int multMax = 0;
		for (int t = 0; t < splittingSize.size(); t++) {
			if (ceil(splittingSize[t]) == max) {
				multMax++;
			}
			else if (secLarg < splittingSize[t]) {
				secLarg = ceil(splittingSize[t]);
			}
		}
		int MAXX;
		if (multMax == 1) {
			MAXX = secLarg;
		}
		else {
			MAXX = max;
		}
		int minDif = 999999;
		for (int t = 0; t < int(splittingSize.size()); t++) {
			if (ceil(splittingSize[t]) == max) {
				//std::cout << "num " << (numbers[n - 1 - t]) <<" div "<< (2 + splittingNumbers[t]) << " MAX " << func_max(MAXX, ceil(float(numbers[n - 1 - t]) / (2 + splittingNumbers[t]))) << " MIN " << func_min(MIN, (numbers[n - 1 - t]) / (2 + splittingNumbers[t])) << std::endl;
				int dif = func_max(MAXX, ceil(double(numbers[n - 1 - t]) / (2 + splittingNumbers[t]))) - func_min(MIN, (numbers[n - 1 - t]) / (2 + splittingNumbers[t]));
				if (dif <= minDif) {
					minDif = dif;
					index = t;
				}
			}
			else {
				int dif = max - func_min(MIN, (numbers[n - 1 - t]) / (2 + splittingNumbers[t]));
				if (dif < minDif) {
					minDif = dif;
					index = t;
				}
			}
		}
		//std::cout <<"index " << index << std::endl;
		splittingNumbers[index] += 1;
		splittingSize[index] = double(numbers[n - 1 - index]) / (1 + splittingNumbers[index]);
		if (int(splittingSize[index]) < MIN) {
			MIN = int(splittingSize[index]);
		}
		if (minDif != DIF) {
			for (int g=0;g<n;g++){
				std::cout << numbers[g] << " ";
			}
			std::cout << endl;
			std::cout << minDif << " " << DIF <<" "<<i << endl;
			std::cout << "error" << endl;
		}
	}
}

Test 1

Group: 1, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 2

Group: 1, 4, 5, 6

Verdict: WRONG ANSWER

Test 3

Group: 1, 4, 5, 6

Verdict: WRONG ANSWER

Test 4

Group: 1, 4, 5, 6

Verdict: WRONG ANSWER

Test 5

Group: 2, 5, 6

Verdict: WRONG ANSWER

Test 6

Group: 2, 5, 6

Verdict: WRONG ANSWER

Test 7

Group: 3, 5, 6

Verdict: WRONG ANSWER

Test 8

Group: 3, 5, 6

Verdict: WRONG ANSWER

Test 9

Group: 3, 5, 6

Verdict: WRONG ANSWER

Test 10

Group: 3, 5, 6

Verdict: WRONG ANSWER

Test 11

Group: 3, 5, 6

Verdict: WRONG ANSWER

Test 12

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 13

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 14

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 15

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 16

Group: 5, 6

Verdict: WRONG ANSWER

Test 17

Group: 5, 6

Verdict: WRONG ANSWER

Test 18

Group: 5, 6

Verdict: WRONG ANSWER

Test 19

Group: 5, 6

Verdict: WRONG ANSWER

Test 20

Group: 6

Verdict: WRONG ANSWER

Test 21

Group: 6

Verdict: WRONG ANSWER

Test 22

Group: 6

Verdict: WRONG ANSWER