#include #include #include #define SIZE 100 int compare(const void* arg1, const void* arg2) { char* s1 = *((char**)arg1); char* s2 = *((char**)arg2); return strcmp(s1, s2); } int main() { char* pole_smernikov[SIZE]; memset(pole_smernikov, 0, SIZE * sizeof(char*)); int pocet_mien_v_poli = 0; char line[SIZE]; while (fgets(line, SIZE, stdin) != NULL) { line[strcspn(line, "\n")] = 0; // Remove the newline character int pocet_znakov = strlen(line) + 1; // Include the null terminator if (pocet_znakov == 1) // Skip empty lines continue; // Kontrola duplicít int found = 0; for (int i = 0; i < pocet_mien_v_poli; i++) { if (strcmp(pole_smernikov[i], line) == 0) { found = 1; break; } } if (!found) { pole_smernikov[pocet_mien_v_poli] = malloc(pocet_znakov); strcpy(pole_smernikov[pocet_mien_v_poli], line); pocet_mien_v_poli += 1; } } // Triedenie qsort(pole_smernikov, pocet_mien_v_poli, sizeof(char*), compare); // Výpis prijatých a neprijatých študentov int max_students; fgets(line, SIZE, stdin); sscanf(line, "%d", &max_students); printf("Prijati studenti:\n"); for (int i = 0; i < max_students && i < pocet_mien_v_poli; i++) { printf("%s\n", pole_smernikov[i]); } printf("Neprijati studenti:\n"); for (int i = max_students; i < pocet_mien_v_poli; i++) { printf("%s\n", pole_smernikov[i]); } // Uvoľnenie pamäte for (int i = 0; i < pocet_mien_v_poli; i++) { free(pole_smernikov[i]); } return 0; }