kuro kurojs

## solution.cpp
#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <map>

using namespace std;


// Time complexity: O(N) for making occ map, O(logN) for making sorted map, and O(N) for buil the answer. So total is O(2N + logN)
	#include <iostream>
	#include <string>
	#include <vector>
	#include <unordered_map>
	#include <map>

	using namespace std;


	// Time complexity: O(N) for making occ map, O(logN) for making sorted map, and O(N) for buil the answer. So total is O(2N + logN)