pvjc24/cv5/program.c

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct student {
  char *name;
  int vote_count;
} student_t;

int compare_students(const void *a, const void *b) {
  const student_t *student_a = a;
  const student_t *student_b = b;

  if (student_a->vote_count > student_b->vote_count) {
    return -1;
  } else if (student_a->vote_count < student_b->vote_count) {
    return 1;
  }

  return strcmp(student_a->name, student_b->name);
}

int main() {
  student_t *students = NULL;
  int students_capacity = 0;
  int student_count = 0;

  char line[1024];
  while (fgets(line, sizeof(line), stdin)) {
    int vote_count;
    char *name;
    sscanf(line, "%d %ms", &vote_count, &name);

    if (student_count >= students_capacity) {
      students_capacity = (students_capacity + 1) * 2;
      student_t *new_students = realloc(students, students_capacity * sizeof(student_t));
      if (new_students == NULL) {
        fprintf(stderr, "Error");
        return 1;
      }
      students = new_students;
    }

    students[student_count].name = name;
    students[student_count].vote_count = vote_count;
    student_count++;
  }

  qsort(students, student_count, sizeof(student_t), compare_students);

  printf("Results:\n");
  for (int i = 0; i < student_count; i++) {
    printf("%d %s\n", students[i].vote_count, students[i].name);
  }

  for (int i = 0; i < student_count; i++) {
    free(students[i].name);
  }
  free(students);

  return 0;
}