Lisäykset

#include <iostream>
#include <map>
#include <unordered_map>
#include <string>
#include <sstream>
#include <vector>
#include <algorithm>

int main(void)
{
	int n, m;
	std::cin >> n >> m;
	std::cin.ignore();

	std::string alkusis;
	std::getline(std::cin, alkusis);
	std::stringstream ss(alkusis);

	std::map<int, int> luvut;
	int luku;
	while (ss >> luku)
		luvut[luku]++;

	std::string ope;
	std::getline(std::cin, ope);
	std::stringstream sope(ope);

	std::vector<int> kk;
	int asd;
	while (sope >> asd)
		kk.push_back(asd);
	std::sort(kk.begin(), kk.end());

	for (int i = 0; i < m; ++i)
	{
		int k = kk[i];
		int pienin_maara = luvut.begin()->second;
		while (k + kk[i + 1] <= pienin_maara)
			k += kk[++i];

		std::unordered_map<int, int> lis;
		while (k > 0 && !luvut.empty())
		{
			auto it = luvut.begin();
			int luku = it->first;
			int maara = it->second;
//			std::cout << "Luku: " << luku << " | Maara: " << maara << " | k: " << k << std::endl;
			int sub = k >= maara ? maara : k;
			k -= sub;
			it->second -= sub;

			if (it->second == 0)
				luvut.erase(it);

			lis[luku + 1] += sub;
		}
		for (const auto& [luku, maara] : lis)
			luvut[luku] += maara;
	}

	std::string str;
	for (const auto& [luku, maara] : luvut)
	{
		for (int i = 0; i < maara; ++i)
			str += std::to_string(luku) + " ";
	}
	std::cout << str << std::endl;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 3

Verdict: ACCEPTED

Test 4

Group: 1, 3

Verdict: ACCEPTED

Test 5

Group: 1, 3

Verdict: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: ACCEPTED

Test 9

Group: 3

Verdict: ACCEPTED

Test 10

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED