schedule.cpp

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdlib>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>

#define long long long
#define nln '\n'

using namespace std;

int main()
{
    //freopen("schedule.inp", "r", stdin);
    long n;
    cin >> n;
    cin.ignore();
    vector<pair<pair<long, long>, string>> sav;
    // vector tren tac dung nhu sau:
    // luu 1 cap pair o moi phan tu
    // phan tu first luu gio va phut (h va m o duoi)
    // phan tu second luu noi dung
    for (long i = 0; i < n; ++i)
    {
        string str;
        getline(cin, str, nln);
        long h = 0;
        for (long j = 0; j < (long)str.find(":"); ++j)
            h += (str[j]-'0')*pow(10, (2-j-1));
        long m = 0;
        for (long j = (long)str.find(":")+1; j < (long)str.find(" "); ++j)
            m += (str[j]-'0')*pow(10, (5-j-1));
        sav.push_back({{h, m}, str});
        // dat h va m len truoc de sap xep tang dan
    }
    sort(sav.begin(), sav.end());
    // Sau khi sap xep ta duoc mot vector moi.
    // Vector moi co noi dung thay doi theo chieu
    // tang dan cua gio va phut (h va m o tren).
    for (const auto &i : sav)
        cout << i.second << nln;
    return 0;
}