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 elem
- {
- int sorszam;
- char nev[ 36 ];
- int pontszam;
- }ELEM;
- int rendez (const void *a, const void *b)
- {
- ELEM *pa=(ELEM *)a;
- ELEM *pb=(ELEM *)b;
- if (pa->pontszam < pb->pontszam) return 1;
- if (pa->pontszam > pb->pontszam) return -1;
- if (pa->pontszam == pb->pontszam){
- if (pa->sorszam > pb->sorszam)
- return 1;
- if (pa->sorszam < pb->sorszam)
- return -1;
- }
- }
- int main(int argc, char *argv[])
- {
- FILE *be, *ki;
- be=fopen(argv[1], "r");
- ki=fopen(argv[2], "wb");
- int i=0;
- char *tok;
- char sor[81];
- while (fgets(sor, 81, be))
- i++;
- ELEM t[i];
- rewind(be);
- while (fgets(sor, 81, be)){
- t[i].sorszam=i+1;
- tok=strtok(sor, ";");
- strcpy(t[i].nev, tok);
- tok=strtok(NULL, ";");
- t[i].pontszam=atoi(tok);
- while (tok=strtok(NULL, ";")){
- t[i].pontszam=t[i].pontszam+(atoi(tok));
- }
- i++;
- qsort(t, db, sizeof(ELEM), rendez);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement