pvjc22/du5/program.c

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define SIZE 100

struct student {
    char name[SIZE];
    int votes;
};


int find_student(struct student* students,int size, const char* name);

int compare(const void* p1, const void* p2);

int main(){

    struct student databaza[SIZE];
        memset(databaza,0,SIZE*sizeof(struct student));
        int size = 0;

    while(1){
            char line[SIZE];
            memset(line,0,SIZE);
            char* r = fgets(line,SIZE,stdin);
            if (r == NULL){
            // Nastal koniec načítania
            break;
        }

        char* end = NULL;
        int value = strtol(line,&end,10);
        if (value == 0){
            // Premena sa nepodarila
            break;
        }
        char *name=end+1;

        int id = find_student(databaza,size,name);
        if (id< 0){
            // Skopirujte zaznam na posledne miesto v poli
            memcpy(databaza[size].name,name,strlen(name)+1);
            databaza[size].votes=value;
            // Zvacsite pocet zaznamov
            size+=1;
            if(size>1)
                qsort(databaza, size, sizeof(struct student), compare);
        }
        else {
            databaza[id].votes+=value;
        }
    }
    printf("Vysledky:\n");
    for(int idx=0;databaza[idx].name[0]!='\0';idx++)
        printf("%d %s", databaza[idx].votes, databaza[idx].name);

    return EXIT_SUCCESS;
}

int find_student(struct student* students,int size, const char* name){
    for(int idx=0; idx<size;idx++)if(strcmp(students[idx].name,name)==0)return idx;
    return -1;
}

int compare(const void* p1, const void* p2){
    struct student* s1 = (struct student*)p1;
    struct student* s2 = (struct student*)p2;
    
    int res=(s2->votes)-(s1->votes);
    for(int idx=0; res==0||(s1->name[idx])!='\0';idx++){
        res=(int)(s2->name[idx])-(int)(s1->name[idx]);
    }
        
    return (s2->votes)-(s1->votes);
}