From 07d2180c57632129a9fa111a1f2d3e1cef1bd5da Mon Sep 17 00:00:00 2001
From: st529yr <simona.tancakova@student.tuke.sk>
Date: Wed, 20 Mar 2024 16:22:08 +0100
Subject: [PATCH] funguje

---
 cv5/program.c | 91 ++++++++++++++++++++++++++++++++-------------------
 1 file changed, 58 insertions(+), 33 deletions(-)

diff --git a/cv5/program.c b/cv5/program.c
index 61674c9..e43b400 100644
--- a/cv5/program.c
+++ b/cv5/program.c
@@ -2,53 +2,78 @@
 #include <stdlib.h>
 #include <string.h>
 
-#define MAX_NAME_LENGTH 100
-#define MAX_BUFFER_LENGTH 256
-
 #define SIZE 100
 
 struct student {
     char name[SIZE];
     int votes;
 };
-struct student database[SIZE];
-memset(database, 0, SIZE * sizeof(struct student));
-int size = 0;
-char line[SIZE];
-memset(line, 0, SIZE);
-char *r = fgets(line, SIZE, stdin);
-if (r == NULL) {
-    // Nastal koniec vstupu
-}
-char *end = NULL;
-int value = strtol(line, &end, 10);
-if (value == 0) {
-    // Prevod sa nepodaril
+
+// Funkcia pre porovnanie dvoch študentov
+int compare(const void *p1, const void *p2) {
+    const struct student *s1 = (const struct student *)p1;
+    const struct student *s2 = (const struct student *)p2;
+    
+    // Porovnanie počtu hlasov
+    if (s1->votes != s2->votes) {
+        return s2->votes - s1->votes; // Zoradenie zostupne podla poctu hlasov
+    } else {
+        // Ak maju rovnaky pocet hlasov, zoradime lexikograficky podla mena
+        return strcmp(s1->name, s2->name);
+    }
 }
 
-// Pre pokračovanie získame meno študenta
-char name[SIZE];
-memset(name, 0, SIZE);
-char *name_start = end + 1;
-int name_length = strlen(name_start) - 1; // Nezahrňujeme koniec riadka
-if (name_length > 0) {
-    memcpy(name, name_start, name_length);
-} else {
-    // Nepodarilo sa načítať meno
-}
+// Funkcia na hladanie studenta v databaze
 int find_student(struct student *students, int size, const char *name) {
     for (int i = 0; i < size; i++) {
         if (strcmp(students[i].name, name) == 0) {
-            return i; // Nájdený študent
+            return i; // Student najdeny
         }
     }
-    return 0; // Študent nenájdený
+    return -1; // Student nenajdeny
 }
-int id = find_student(database, size, name);
-if (id < 0) {
-    //
+
+int main() {
+    struct student database[SIZE];
+    memset(database, 0, SIZE * sizeof(struct student));
+    int size = 0;
     
-
-    return 1;
+    char line[SIZE];
+    while (fgets(line, SIZE, stdin) != NULL) {
+        int votes;
+        char name[SIZE];
+        
+        // Nacitanie hlasov a mena
+        if (sscanf(line, "%d %[^\n]", &votes, name) != 2) {
+            fprintf(stderr, "Chyba pri citani riadku: %s", line);
+            return 1;
+        }
+        
+        // Hladanie studenta v databaze
+        int idx = find_student(database, size, name);
+        if (idx == -1) {
+            // Student nie je v databaze, pridame ho
+            if (size >= SIZE) {
+                fprintf(stderr, "Prekroceny limit databazy\n");
+                return 1;
+            }
+            strcpy(database[size].name, name);
+            database[size].votes = votes;
+            size++;
+        } else {
+            // Student je v databaze, pripocitame hlasy
+            database[idx].votes += votes;
+        }
+    }
+    
+    // Zoradenie databazy
+    qsort(database, size, sizeof(struct student), compare);
+    
+    // Vypis databazy
+    for (int i = 0; i < size; i++) {
+        printf("%d %s\n", database[i].votes, database[i].name);
+    }
+    
+    return 0;
 }