- 01
- 02
- 03
- 04
- 05
- 06
- 07
- 08
- 09
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
#include <iostream>
using namespace std;
struct STUDENT
{
int name;
char namberGroup;
float uspevaimost[5];
};
void main()
{
char j;
char a,b;
STUDENT massive[10];
for (j=0; j<10; j++)
{
cout<<" Name: ";cin>>massive[j].name;
cout<<" namberGroup: ";cin>>massive[j].namberGroup;
cout<<" uspevaimost[0]: ";cin>>massive[j].uspevaimost[0];
cout<<" uspevaimost[1]: ";cin>>massive[j].uspevaimost[1];
cout<<" uspevaimost[2]: ";cin>>massive[j].uspevaimost[2];
cout<<" uspevaimost[3]: ";cin>>massive[j].uspevaimost[3];
cout<<" uspevaimost[4]: ";cin>>massive[j].uspevaimost[4];
}
char cdecl strcmp(const void* a, const void* b);
{
int strcmp(((STUDENT*)a)->name);((STUDENT*)b)->name;
qsort(massive,sizeof(massive)/sizeof(massive[0]),sizeof(massive[0]),massive[j].name);
}
int k;
cin>>k;
}
Комментарии (0) RSS
Добавить комментарий