#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

int main()
{

	vector<vector<int>>VEC;
	int num = 1, value = 1;

	while (num || value)
	{
		cout << "num: ";
		cin >> num;
		cout << "value: ";
		cin >> value;
		
		if (VEC.size() <= num)
			VEC.resize(num + 1);
		
		VEC[num].push_back(value);

	}
	
	cout << endl;

	cout << "unsorted vector:  " << endl;
	for (int i = 0; i < VEC.size(); i++)
		for (int j = 0; j < VEC[i].size(); j++)
			cout << "i: " << i << " j: " << j << " value= " << VEC[i][j] << " " << endl;
	for (int i = 0; i < VEC.size(); i++)
		sort(VEC[i].begin(), VEC[i].end());

	cout << "\n sorted vector:  " << endl;
	for (int i = 0; i < VEC.size(); i++)
		for (int j = 0; j < VEC[i].size(); j++)
			cout << "i: " << i << " j: " << j << " value= " << VEC[i][j] << " " << endl;


	return 0;
}