#include <iostream>
#include <bitset>
#include <string>
#include <stdexcept>
#include <exception>
#include <list>
#include <algorithm>
#include <iterator>
#include <ctime>
#include <numeric>
#include <deque>
#include <vector>
#include <set>
#include <fstream>

using namespace std;

class Exam
{
protected:
    struct XXX
    {
        string Name_Subject;
        string Last_name;
        unsigned int ball;
    };
    XXX temp;
    deque<XXX> list;
public:
    Exam() {}
    Exam(string sub, string name, unsigned int number)
    {
        temp.Name_Subject = sub;
        temp.Last_name = name;
        temp.ball = number;
        list.push_back(temp);
    }
    Exam(Exam& exam)
    {
        this->temp = exam.temp;
        this->list = exam.list;
    }
    ~Exam() {}

    void Add_to_list(string sub, string name, unsigned int number)
    {
        temp.Name_Subject = sub;
        temp.Last_name = name;
        temp.ball = number;
        list.push_back(temp);
    }
    void Pop_Front() { list.pop_front(); }
    void Pop_Back() { list.pop_back(); }
    void Show_obj() { cout << "Предмет: " << temp.Name_Subject << endl << "Фамілія: " << temp.Last_name << endl << "Оцінка: " << temp.ball << endl << endl; }
    friend istream& operator>>(istream& is, Exam::XXX& temp)
    {
        is >> temp.Name_Subject >> temp.Last_name >> temp.ball;
        return is;
    }
    friend ostream& operator<<(ostream& os, Exam::XXX& temp)
    {
        os << "Предмет: " << temp.Name_Subject << endl << "Фамілія: " << temp.Last_name << endl << "Оцінка: " << temp.ball << endl << endl;
        return os;
    }
    void Sort_first_simbol_Subject()
    {
        for (size_t i(0); i < this->list.size(); i++)
        {
            for (size_t j(0); j < this->list.size() - 1; j++)
            {
                if (static_cast<int>(this->list[j].Name_Subject[0]) > static_cast<int>(this->list[j + 1].Name_Subject[0]))
                {
                    swap(list[j], list[j + 1]);
                }
            }
        }
    }
    void Sort_first_simbol_Last_name()
    {
        for (size_t i(0); i < this->list.size(); i++)
        {
            for (size_t j(0); j < this->list.size() - 1; j++)
            {
                if (static_cast<int>(this->list[j].Last_name[0]) > static_cast<int>(this->list[j + 1].Last_name[0]))
                {
                    swap(list[j], list[j + 1]);
                }
            }
        }
    }
    void Sort_ball()
    {
        for (size_t i(0); i < this->list.size(); i++)
        {
            for (size_t j(0); j < this->list.size() - 1; j++)
            {
                if (this->list[j].ball > this->list[j + 1].ball)
                {
                    swap(list[j], list[j + 1]);
                }
            }
        }
    }
    void Show_list()
    {
        for (size_t i(0); i < this->list.size(); i++)
        {
            cout << "Предмет: " << this->list[i].Name_Subject << endl << "Фамілія: " << this->list[i].Last_name << endl << "Оцінка: " << this->list[i].ball << endl << endl;
        }
    }
};

int main()
{
    setlocale(LC_ALL, "Ukrainian");

    ifstream  fin;
    ofstream fout;


    string Path("C:\\test\\Test.txt"); // Путь к файлу на жестком диске.
    fin.open(Path, ios::in);
    try
    {
        if (!fin.is_open()) { throw exception("File is not found !!!"); }
    }
    catch (const exception& ex) { cout << ex.what() << endl; system("pause"); return -1; }

    Exam Mylist;

    while (!fin.eof())
    {
        string Subject, Last_name;
        unsigned int ball;
        fin >> Subject >> Last_name >> ball;
        if (fin.fail())
        {
            fin.clear();
            break;
        }
        Mylist.Add_to_list(Subject, Last_name, ball);
    }
    fin.close();
    Mylist.Sort_first_simbol_Last_name();
    Mylist.Show_list();
    system("pause");
    return 0;
}