Data Structutre Sort

#include <bits/stdc++.h>

using namespace std;

struct Student {
    string name, surname;
    int marks[5];

    double getAverageMark() {
        int sum = 0;
        for (int i = 0; i < 5; ++i) {
            sum += marks[i];
        }
        return (sum / 5.0);
    }
};

bool cmp(Student A, Student B) {
    return (A.getAverageMark() > B.getAverageMark());
}

int main() {
    std::ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    Student a[n];
    for (int i = 0; i < n; ++i) {
        cin >> a[i].name >> a[i].surname;
        for (int j = 0; j < 5; ++j) {
            cin >> a[i].marks[j];
        }
    }

    sort(a + 0, a + n, &cmp);

    for (int i = 0; i < n; ++i) {
        cout << a[i].name << " " << a[i].surname << " " << a[i].getAverageMark() << endl;
    }
    return 0;
}