#include <iostream>
#include <algorithm>
using namespace std;
struct student {
char name[100];
int group;
};
int compare(const void *a, const void *b) {
student *student1 = (student *) a;
student *student2 = (student *) b;
return (student1->group - student2->group);
}
int main() {
size_t dimension = 3;
cout << "Enter 3 students for sorting: " << endl;
struct student students[dimension];
string query;
for (int i = 0; i < dimension; ++i) {
cout << "Enter name of the student[" << i << "]" << endl;
cin >> students[i].name;
cout << "Enter group of the student" << i << "]" << endl;
cin >> students[i].group;
}
cout << "Entered array:" << endl;
for (int i = 0; i < dimension; ++i) {
cout << students[i].name << " - " << students[i].group << endl;
}
qsort(students, dimension, sizeof(student), compare);
cout << "Sorted array by group:" << endl;
for (int i = 0; i < dimension; ++i) {
cout << students[i].name << " - " << students[i].group << endl;
}
return 0;
}