Need help with sorting Urgent ://

[Melicalol]

Ok so I did this project where I take in a date, vector int year, vector int month, vector int day and a vector string called appointment
thing is I suck at c++, so I didn't do it in a struct or a class. Just made a bunch of vector functions.
Now I am trying to organize my vectors so they all go together. Assuming the logic would be organize the year vector then bubble sort rest,... do same with month vector... then day vector


my problem now is

for (int j = 0; j<days.size() && j<months.size() && j<years.size() && j<appointments.size();++j)
{
	temp1 = months[j];
	temp2 = years[j];
	temp3 = appointments[j];	
	temp4 = days[j];
	for(int i = 1; i<years.size();++i)
	{
		if (years[i-1]> years[i])  //.erase[i]   check years... months ... then days
		{
			years.push_back(years[i-1]);
			months.push_back(temp1);
			appointments.push_back(temp3);
			days.push_back(temp4);
			months.erase (months.begin()+0);
			years.erase (years.begin()+0);
			appointments.erase (appointments.begin()+0);
			days.erase (days.begin()+0);
		}
	}
	for(int i = 1; i<months.size();++i)
	{
		if (months[i-1]> months[i])  //.erase[i]   check years... months ... then days
		{
			months.push_back(months[i-1]);
			years.push_back(temp2);
			appointments.push_back(temp3);
			days.push_back(temp4);
			months.erase (months.begin()+0);
			years.erase (years.begin()+0);
			appointments.erase (appointments.begin()+0);
			days.erase (days.begin()+0);

		}
	}
	for(int i = 1; i<days.size();++i)
	{
		if (days[i-1]> days[i])  //.erase[i]   check years... months ... then days
		{
			days.push_back(days[i-1]);
			months.push_back(temp1);
			years.push_back(temp2);
			appointments.push_back(temp3);
			months.erase (months.begin()+0);
			years.erase (years.begin()+0);
			appointments.erase (appointments.begin()+0);
			days.erase (days.begin()+0);
		}
	}
} 	

I am erasing the first vector, how do I erase the vector slot I push back not the first only?