Появились сложности со структурами, у меня ничего не выходит(с++)

You should follow this instructions

// Upload solutions in one file (*.txt or *.cpp)!
// Write your variant as comment
// You should start your code from comment as "// Task 1" or "// Task 2"
// Once you`ve done with Task 1 (or you have nothing to add), comment out full code and proceed with Task 2



Variant 1
Task #1 // 60%

Create two structs:

struct Group which has:
- ID (char*) // ID группы (Например: CSSE1718)
- studentsCount(int) //количество студентов в группе
- Students(pointer to Student struct). //указатель на объекты студентов

struct Student which has:
- ID (int)
- fullname (char *) // имя студента
- GPA (double)

Your task is to 'form an array' of best students from each group and sort them by fullname in increasing order.
Have to: use functions, structs, pointers, dynamic memory allocation/deallocation and strings.

Input:
n (how many groups) [2 <= n <= 10]
n-times:
group ID
studentsCount
all information about Students

Output:
All best students sorted by fullname in ascending order

Example:

Input:
3
CSSE1820
3
14512
Tsoi Alexandr
3.15
14513
Karpova Lyudmila
3.27
14514
Zholdasbekov Samat
2.98
CSSE1821
3
14515
Karyakin Sergei
2.83
14516
Carlsen Sven Magnus
3.51
14517
Kasparov Garry Kimovich
4.00
CSSE1822
2
14510
Ivanov Pavel
2.75
14511
Amanbayev Damir
3.34

Output:
Amanbayev Damir 3.34
Karpova Lyudmila 3.27
Kasparov Garry Kimovich 4
________________________________________ ________________________________________ ________________________________________ _________

Task #2

Train system.

Each day there are a number of trains going through the station. A station consists of several platforms for trains.
The train has id, destination, arrival time and time when it leaves the platform.
Your task is to identify the minimum number of platforms that we need to have in a station so that we WILL NOT have any queue.

You are NOT allowed to use STRCMP function for comparing times!

Have to: use structs, functions, strings, pointers and dynamic memory allocation.

Example:

Input:
7
201 Kostanay 12:05 12:45
24 Astana 12:00 12:30
19 Kyzylorda 15:20 15:40
4 Aktobe 12:00 12:10
57 Shymkent 15:20 15:50
48 Taraz 12:15 15:43
123 Kokshetau 15:41 16:00

Output:
3

0