Advertisement
Vityok

Beszamolo

Nov 21st, 2017
71
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.85 KB | None | 0 0
  1. #include <string.h>
  2. #include <stdlib.h>
  3. #include <stdio.h>
  4.  
  5. typedef struct
  6. {
  7.   char nev[52];
  8.   int het;
  9. }ELEM;
  10.  
  11. int rendez(const void *a, const void *b)
  12. {
  13.   ELEM *x = (ELEM*)a;
  14.   ELEM *y = (ELEM*)b;
  15.  
  16.   if(x->het < y->het) return -1;
  17.   if(x->het > y->het) return 1;
  18.  
  19.   return strcmp(x->nev,y->nev);
  20.  
  21. }
  22.  
  23. int main()
  24. {
  25.   ELEM tomb[20];
  26.   int i,db,j,talalt,hossz;
  27.   char sor[100],*token;
  28.  
  29.   i=db=0;
  30.  
  31.   while(fgets(sor,100,stdin))
  32.   {
  33.     token=strtok(sor,"/");
  34.     strcpy(tomb[i].nev,token);
  35.  
  36.     talalt=0;
  37.  
  38.     token=strtok(NULL,"/");
  39.     hossz=strlen(token);
  40.  
  41.     for(j=0;j<hossz;j++)
  42.       if(token[j]=='1')
  43.       {
  44.         talalt=j+1;
  45.         break;
  46.       }
  47.  
  48.     tomb[i].het=talalt;
  49.  
  50.     i++;
  51.     db++;
  52.   }
  53.  
  54.   qsort(tomb,db,sizeof(ELEM),rendez);
  55.  
  56.   for(i=0;i<db;i++)
  57.     printf("%s\n",tomb[i].nev);
  58.  
  59.   return 0;
  60. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement