Tikut

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

using namespace std;

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

float maxF(float a, float b) {
	if (a < b) {
		return b;
	}
	return a;
}

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

	}

	std::sort(numbers.begin(), numbers.end());

	for (int i = 0; i < m; i++) {
		int sum = 0;
		int numOfSplits = i + 1;
		std::vector<int> splittingNumbers;
		std::vector<float> splittingSize;
		int sumOfSplittingNums = 0;
		for (int j = n - 1; j >=max(0, n - 1 - i); j--) {
			sum += numbers[j];
			//std::cout << "calc sums jth number " << numbers[j] << endl;
		}
		//std::cout << "sum " << sum << std::endl;
		for (int j = n - 1; j >=max(0, n - 1 - i); j--) {
			//std::cout << "j " << j << endl;
			int splitNum = (numOfSplits) * float(numbers[j]) / sum;
			//std::cout << "splitNm " << splitNum<<" "<< float(numbers[j]) / (splitNum+1) << endl;
			sumOfSplittingNums += splitNum;
			splittingNumbers.push_back(splitNum);
			splittingSize.push_back(float(numbers[j]) / (splitNum + 1));
		}
		int dif = numOfSplits - sumOfSplittingNums;
		while (dif > 0) {
			int max = 0;
			int index = -1;
			for (int t = 0; t < int(splittingSize.size()); t++) {
				if (max < splittingSize[t]) {
					max = splittingSize[t];
					index = t;
				}
			}
			//std::cout << "index " << index<<" "<<splittingNumbers[index]<<" "<< float(numbers[n - 1 - index]) / (1 + splittingNumbers[index]) << " " << n - 1 - index<<" "<<splittingSize.size()<<" "<<splittingNumbers.size() << endl;
			splittingNumbers[index] += 1;
			splittingSize[index] = float(numbers[n - 1 - index]) / (1 + splittingNumbers[index]);
			//std::cout << "splits left "<<dif-1<<" " << splittingSize[index] << endl;
			dif--;
		}
		int max = 0;
		int min = 999999;
		for (int t = 0; t < int(splittingSize.size()); t++) {
			//std::cout << "splitSize "<<t<<" " << splittingSize[t] << endl;
			if (max < ceil(splittingSize[t])) {
				max = ceil(splittingSize[t]);
			}
			if (min > floor(splittingSize[t])) {
				min = floor(splittingSize[t]);
			}
			if (min == 0) {
				//std::cout << "ERROR"<<endl;
			}
		}
		for (int t = n - 1 - int(splittingSize.size()); t >= 0; t--) {
			if (max < numbers[t]) {
				max = numbers[t];
			}
			if (min > numbers[t]) {
				min = numbers[t];
			}
			//std::cout << "min check " << numbers[t] << " " << min << endl;
			//std::cout << "max check " << numbers[t] << " " << max << endl;


		}
		//std::cout << "abs diff " << max - min<<" "<<max<<" "<<min << endl;
		//std::cout << endl;
		if (i < m - 1) {
			std::cout << max - min << " ";
		}
		else {
			std::cout << max - min;
		}
	}
	std::cout << "\n";
}

Test 1

Group: 1, 3, 4, 5, 6

Verdict: ACCEPTED

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: ACCEPTED

Test 5

Group: 2, 5, 6

Verdict: ACCEPTED

Test 6

Group: 2, 5, 6

Verdict: ACCEPTED

Test 7

Group: 3, 5, 6

Verdict: ACCEPTED

Test 8

Group: 3, 5, 6

Verdict: ACCEPTED

Test 9

Group: 3, 5, 6

Verdict: ACCEPTED

Test 10

Group: 3, 5, 6

Verdict: ACCEPTED

Test 11

Group: 3, 5, 6

Verdict: WRONG ANSWER

Test 12

Group: 4, 5, 6

Verdict: ACCEPTED

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: RUNTIME ERROR

double free or corruption (out)

Test 17

Group: 5, 6

Verdict: RUNTIME ERROR

double free or corruption (out)

Test 18

Group: 5, 6

Verdict: RUNTIME ERROR

double free or corruption (out)

Test 19

Group: 5, 6

Verdict: RUNTIME ERROR

double free or corruption (out)

Test 20

Group: 6

Verdict: RUNTIME ERROR

double free or corruption (out)

Test 21

Group: 6

Verdict: RUNTIME ERROR

double free or corruption (out)

Test 22

Group: 6

Verdict: RUNTIME ERROR

double free or corruption (out)