Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
- typedef struct{
- char nev[40];
- int db1;
- int db2;
- }ELEM;
- int rendez( const void *a,const void *b)
- {
- ELEM *x= (ELEM *) a;
- ELEM *y= (ELEM *) b;
- if ( x->db1 < y->db1 ) return 1;
- if ( x->db1 > y->db1 ) return -1;
- if ( x->db2 < y->db2 ) return 1;
- if ( x->db2 > y->db2 ) return -1;
- return strcmp(x->nev,y->nev);
- }
- int main()
- {
- /* FILE *f;
- f=fopen("c.txt","w");*/
- int i=0,db=0,ertek1,ertek2;
- char sor[100],*token;
- ELEM t[20];
- while ( fgets(sor,100,stdin))
- {
- token = strtok(sor, "/");
- strcpy(t[i].nev,token);
- token= strtok(NULL,"/");
- int hossz,j;
- hossz = strlen (token);
- ertek1=0;
- ertek2=0;
- for (j = 0; j < hossz ; j++)
- {
- if ( token[j] == '1') ertek1++;
- if ( token[j] == '2') ertek2++;
- }
- t[i].db1=ertek1;
- t[i].db2=ertek2;
- db++;
- i++;
- }
- qsort (t,db,sizeof(ELEM),rendez);
- for ( i = 0; i < db ; i++)
- /* fprintf(f,"%s %d %d\n",t[i].nev,t[i].db1,t[i].db2); */
- printf("%s\n",t[i].nev);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement