test.cpp

int calcLoad(int sectors[], int n)
{
	//return 0;
	if (n > 43)
	{
		n = 43;
	}
	int max = std::accumulate(sectors, sectors + (n > 7 ? 7 : n), 0);
	if (n <= 7)
	{
		return max;
	}

	int nextRange = 12;
	int elements = 6;
	for (;;)
	{
		auto last = sectors + (nextRange + 1 > n ? n : nextRange + 1);
		auto middle = last - elements;
		auto first = middle - 7;
		if (first < sectors)
		{
			first = sectors;
		}
		std::nth_element(first, middle, last);
		int sum = std::accumulate(middle, last, 0);
		max = max > sum ? max : sum;
		if (elements > 1 && nextRange + 1 < n)
		{
			nextRange += 6;
			elements -= 1;
		}
		else
		{
			break;
		}
	}

	return max;
}