Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- typedef struct{
- int limit;
- int hero;
- int res;
- int score;
- size_t number;
- }Scores;
- void sort(Scores* arr, size_t len, int v);
- int main()
- {
- size_t len;
- int v;
- printf("Players:\n");
- scanf("%zu",&len);
- Scores arr[len];
- for(size_t i = 0; i < len; i++){
- printf("Player %zu:\n",i+1);
- printf("limit/hero/res/scores:");
- scanf("\n%d %d %d %d",&arr[i].limit,&arr[i].hero,&arr[i].res,&arr[i].score);
- arr[i].number = i + 1;
- }
- do{
- printf("[1]limit\n[2]hero\n[3]res\n[4]score\n");
- scanf("%d",&v);
- }while(v < 1 || v > 4);
- sort(arr,len,v);
- for(size_t i = 0; i < len; i++){
- printf("Player %zu:\n",arr[i].number);
- printf("limit/hero/res/scores:");
- printf("\n%d %d %d %d\n",arr[i].limit,arr[i].hero,arr[i].res,arr[i].score);
- }
- return 0;
- }
- void sort(Scores* arr, size_t len, int v){
- switch (v)
- {
- case 1:
- for (size_t i = 0; i < len; i++){
- for (size_t j = 0; j < len; j++){
- if(arr[i].limit > arr[j].limit){
- Scores doka3 = arr[i];
- arr[i] = arr[j];
- arr[j] = doka3;
- }
- }
- }
- break;
- case 2:
- for (size_t i = 0; i < len; i++){
- for (size_t j = 0; j < len; j++){
- if(arr[i].hero > arr[j].hero){
- Scores doka3 = arr[i];
- arr[i] = arr[j];
- arr[j] = doka3;
- }
- }
- }
- break;
- case 3:
- for (size_t i = 0; i < len; i++){
- for (size_t j = 0; j < len; j++){
- if(arr[i].res > arr[j].res){
- Scores doka3 = arr[i];
- arr[i] = arr[j];
- arr[j] = doka3;
- }
- }
- }
- break;
- case 4:
- for (size_t i = 0; i < len; i++){
- for (size_t j = 0; j < len; j++){
- if(arr[i].score > arr[j].score){
- Scores doka3 = arr[i];
- arr[i] = arr[j];
- arr[j] = doka3;
- }
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement