Sort paste

#include<iostream>
#include<fstream>
#include<string>
#include<iomanip>

using namespace std;

ifstream in("Input.txt");
ofstream out("Output.txt");


struct Student
{
	string name, secondname, fam;
	int year;
	int mark[5];
	int key;
	void print();
};

void Student::print()
{
	 out<< setw(12) << left << fam << setw(10) << name << setw(15) << secondname << setw(5) << year;;

	for (int i = 0; i < 5; i++)
	{
		out << setw(3) << mark[i];
	}
	out << setw(5) << key<<endl;
}

void sort(Student *a, int n)
{
	Student temp;
	int i, j;
	for (i = 2; i <= n; i++)
	{
		j = i;
		while (a[j].key < a[j - 1].key)
		{
			temp = a[j];
			a[j] = a[j - 1];
			a[j - 1] = temp;
			j--;
		}
	}
}

int main()
{
	int n = 0, m, i;
	Student stud[10];

	if (!in)
	cout << "Error,file Input.txt doesn't open";

	else
	{
		in >> m;
		while (in.peek() != EOF)
		{
			in >> stud[n].fam;
			in >> stud[n].name;
			in >> stud[n].secondname;
			in >> stud[n].year;
			for (int i = 0; i < 5; i++)
			{
				in >> stud[n].mark[i];
				stud[n].key += stud[n].mark[i];
			}

			n++;
		}
		sort(stud, n);
		out << m << endl;
		for (int i = 3; i >= 0; i--)
			stud[i].print();
	}
	in.close();
	out.close();
	return 0;
}