//This part makes sense, the basic stuff
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include<iomanip>
using namespace std;
 
template<class t1, class t2, class t3, class t4, class t5, class t6>
void SORT
(vector<t1> ,vector<t2> ,vector<t3> ,vector<t4> ,vector<t5> ,vector<t6> );
 
 
template<class type>
void sort(const vector<type>&);
 
template<class type>
void print(vector<type> v);
 
//This part I knew, no question about it.
//Initializing everything to zero and getting it read and in the function
int main()
{
vector<string> AminoAcid(0);
vector<int> O(0);
vector<int> C(0);
vector<int> N(0);
vector<int> S(0);
vector<int> H(0);
int n;
 
ifstream fin("input.txt");
string test;
 
if(fin.fail())
{cerr<<"Problem opening file";}
else
{
string word;
int atoms;
int i = 0;
while(!fin.eof())
{
fin>>word;
AminoAcid.push_back(word);
fin>>atoms;
O.push_back(atoms);
fin>>atoms;
C.push_back(atoms);
fin>>atoms;
N.push_back(atoms);
fin>>atoms;
S.push_back(atoms);
fin>>atoms;
H.push_back(atoms);
i++;
}
n = i-1;
}
SORT(AminoAcid,O,C,N,S,H);
 
///Simply spitting back the values to see if I got the initial function stuff
// right, which I did.
for(int j = 0;j<n;j++)
{
cout<<setw(15)<<Amino[j]<<setw(10);
cout<<O[j]<<setw(10);
cout<<C[j]<<setw(10);
cout<<N[j]<<setw(10);
cout<<S[j]<<setw(10);
cout<<H[j]<<endl;
}
 
 
fin.close();
return 0;
}
 
 
/* FUNCTION SORT */
 
template<class t1, class t2,class t3,class t4, class t5, class t6>
void SORT(vector<t1> v1,vector<t2> v2,vector<t3> v3,vector<t4> v4,vector<t5> 
v5,vector<t6> v6)
{
sort(v2); 
print(v2);
// This is where we do that sorting I described above, but I have no idea HOW 
// to do that (TA gave us the two lines right above this comment line, but 
// I don't know how it relates or where to go from here at all) 
return;
}
 
 
// This is the part the TA COULD help me with, of course it had to be 
// what I already knew and similar to programs we've already covered...
template<class type>
void sort(vector<type>& x)
{
int n = x.size();
int hold;
 
// Implement selection sort algorithm.
 
for (int k = 0; k <= n - 2; k++) 
{
for (int j = k + 1; j <= n - 1; j++)
{
if (x[k] > x[j])
{
hold = x[j];
x[j] = x[k];
x[k] = hold;
}
}
}
}
 
// Another part the TA gave just today, but I'm not too sure how it relates....
template<class type>
void print(vector<type> v)
{
int n = v.size();
 
for( int i = 0; i < n-1; i++ )
{cout<<v[i]<<endl;}
 
}

if (int y = 0; int z = 1; O[y] > O[z]; y++; z++;)
		{
		return 1;
		}
 
else if (O[y] < O[z];)
		{
		return -1;
		}
else { if (Amino[y] > Amino[z];)
			{
				return 1;
			}
		else if (Amino[y] < Amino[z];)
			{
			return -1;
			}
		else { if (C[y] < C[z];)

#include <algorithm>
#include <iostream>
#include <string>
#include <fstream>
#include <vector>
#include <string>
using namespace std;
 
int main()
{
vector<string> Amino(0);
vector<int> O(0);
vector<int> C(0);
vector<int> N(0);
vector<int> S(0);
vector<int> H(0);
int n;
 
struct row
{
    std::string m_1;
    int m_2;
    int m_3;
    int m_4;
    int m_5;
 
    bool const operator<(row const & r) const
    {
        for (z =< size() );
 
{
int y = 0;
int z = 1;
int c;
 
if (O[y] > O[z]);
		{
			c = 1;
			return 0;
		}
 
else if (O[y] < O[z]);
		{
			c = -1;
			return 0;
		}
else { if (Amino[y] > Amino[z]);
			{
				c = 1;
				return 0;
			}
		else if (Amino[y] < Amino[z]);
			{
				c = -1;
				return 0;
			}
		else { if (C[y] > C[z]);
				{
					c = 1;
					return 0;
				}
				else if (C[y] < C[z]);
				{
					c = -1;		
					return 0;
				}
				else { if (N[y] > N[z]);
						{
							c = 1;
							return 0;
						}
						else if (N[y] < N[z]);
							{
								c = -1;
								return 0;
							}
						else {if (S[y] > S[z]);
								{
									c = 1;
									return 0;
								}
								else if (S[y] < S[z]);
									{
										return 0;
									}
								else {if (H[y] > H[z]);
										{
											c = 1;									
											return 0;
										}
										else if (H[y] < H[z]);
											{
												c = -1;
												return 0;
											}
								}
    }
				}
				}
 
};
 
typedef std::vector<row> rows;
 
template<typename container_type>
void my_sort(container_type & c)
{
    if (c = -1);
			{
			hold = O[z];
			O[z] = O[y];
			O[y] = hold;
 
			hold = Amino[z];
			Amino[z] = Amino[y];
			Amino[y] = hold;
 
			hold = C[z];
			C[z] = C[y];
			C[y] = hold;
 
			hold = N[z];
			N[z] = N[y];
			N[y] = hold;
 
			hold = S[z];
			S[z] = S[y];
			S[y] = hold;
 
			hold = H[z];
			H[z] = H[y];
			H[y] = hold;
 
			}
		}
	}
y++;
z++;
return 0;
 
}
 
void print_predicate(row const & r)
{
    std::cout 
         << r.m_1 << " "
         << r.m_2 << " "
         << r.m_3 << " "
         << r.m_4 << " "
         << r.m_5 << std::endl;
}
 
int main(int, char*)
{
    rows l_rows;
    ifstream fin("AAM.txt");
string test;
 
if(fin.fail())
	{cerr<<"Problem opening file";}
else
{
	string word;
	int atoms;
	int i = 0;
	while(!fin.eof())
	{
		fin>>word;
	    Amino.push_back(word);
		fin>>atoms;
		O.push_back(atoms);
		fin>>atoms;
		C.push_back(atoms);
		fin>>atoms;
		N.push_back(atoms);
		fin>>atoms;
		S.push_back(atoms);
		fin>>atoms;
		H.push_back(atoms);
		i++;
	}
	n = i-1;
}
    my_sort(l_rows);
 
    std::for_each(l_rows.begin(), l_rows.end(), print_predicate);
	fin.close();
return 0;
}