From b8de26520a4272d537149cac20b5fba0a50710a9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Tom=C3=A1=C5=A1=20Vl=C4=8Dek?= <tomas.vlcek@student.tuke.sk>
Date: Wed, 11 Mar 2026 23:32:31 +0000
Subject: [PATCH] Aktualizovat du2/program.c

---
 du2/program.c | 11 ++++++-----
 1 file changed, 6 insertions(+), 5 deletions(-)

diff --git a/du2/program.c b/du2/program.c
index 0b975d3..c06cc89 100644
--- a/du2/program.c
+++ b/du2/program.c
@@ -11,6 +11,7 @@ int compare(const void* p1, const void* p2);
 struct student {
   int pocetHlasov;
   char meno[SIZE];
+  char priezvisko[SIZE];
 };
 
 int main() {
@@ -39,16 +40,16 @@ int main() {
     int x = 0;
 
     //spracovanie inputu, vycitavanie najdenych mien a najdenych poctov hlasov z retazca
-    while (sscanf(line, "%d %s", &najdPocetHlasov, najdMeno) != -1)
+    while (sscanf(line, "%d %s %s", &najdPocetHlasov, najdMeno, najdPriezvisko) != -1)
     {
-        // DBStudenti[x].meno = najdMeno;
-        // DBStudenti[x].pocetHlasov = najdPocetHlasov;
+        //prekopiruje najdene priezviska 
         strcpy(DBStudenti[x].meno, najdMeno);
+        strcpy(DBStudenti[x].priezvisko, najdPriezvisko);
         DBStudenti[x].pocetHlasov = najdPocetHlasov;
         x += 1;
 
         //reset nacitanych hodnot na konci kazdeho cyklu
-        memset(najdMeno, 0, SIZE);
+        // memset(najdMeno, 0, SIZE);
         najdPocetHlasov = 0;
     }
 
@@ -81,7 +82,7 @@ int main() {
 
         if (s1->pocetHlasov == s2->pocetHlasov)
         {
-            //vrati lexikografciky zorad. instancie v poli
+            //vrati lexikograficky zorad. instancie v poli (podla mena, NIE priezviska)
             return strcmp(s2->meno, s1->meno);
         }