Реализовать поиск в массиве объектов пользовательского типа по заданному полю (структуры) - C++ - Ответ 1536360

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
 
typedef struct Course {
  char *name;
  float price;
  float caloricity;
} Course;
 
typedef struct Meal {
  size_t course_count;
  size_t id;
  struct Course* courses;
} Meal;
 
typedef struct Menu {
  size_t meal_count;
  struct Meal* meals;
} Menu;
 
void InitCourse(struct Course* course) {
  char *slugs[] = { "de", "flo", "pe", "ka", "tsi", "us", "pas", "ta",
                    "bra", "ber", "roni" };
  int slug_size = sizeof(slugs) / sizeof(*slugs);
  course->name = (char*)malloc(64);
  course->name[0] = '\0';
  size_t i;
  for (i = 0; i < 3 + rand() % 3; ++i)
    strcat(course->name, slugs[rand() % slug_size]);
  course->name[0] += 'A' - 'a';
  course->price = (rand() % 10000) / 100.;
  course->caloricity = (rand() % 1000) / 10.;
  printf("%s: %.2f rub / %.1f kkal\n", course->name, course->price,
                                       course->caloricity);
}
 
void DeleteCourse(struct Course* course) {
  free(course->name);
}
 
void InitMeal(size_t course_count, struct Meal *meal, size_t id) {
  meal->id = id;
  meal->course_count = course_count;
  meal->courses = (struct Course*)malloc(sizeof(struct Course) * course_count);
  size_t i;
  for (i = 0; i < course_count; ++i)
    InitCourse(&meal->courses[i]);
}
 
void DeleteMeal(struct Meal *meal) {
  size_t i;
  for (i = 0; i < meal->course_count; ++i)
    DeleteCourse(&meal->courses[i]);
  free(meal->courses);
}
 
void InitMenu(size_t course_count, size_t meal_count, struct Menu *menu) {
  menu->meal_count = meal_count;
  menu->meals = (struct Meal*)malloc(sizeof(struct Meal) * meal_count);
  size_t i;
  for (i = 0; i < meal_count; ++i) {
    printf("Meal #%d:\n", i);
    InitMeal(course_count, &menu->meals[i], i);
  }
}
 
void DeleteMenu(struct Menu *menu) {
  size_t i;
  for (i = 0; i < menu->meal_count; ++i)
    DeleteMeal(&menu->meals[i]);
  free(menu->meals);
}
 
float MealPrice(struct Meal *meal) {
  size_t i;
  float result = 0;
  for (i = 0; i < meal->course_count; ++i)
    result += meal->courses[i].price;
  return result;
}
 
int main(int argc, char *argv[]) {
  srand(time(NULL));
  struct Menu menu;
  
  InitMenu(10, 5, &menu);
  float min_meal_price, max_meal_price;
  min_meal_price = max_meal_price = MealPrice(&menu.meals[0]);
  struct Meal *min_price_meal, *max_price_meal;
  min_price_meal = max_price_meal = &menu.meals[0];
 
  size_t i, j;
  for (i = 1; i < menu.meal_count; ++i) {
    float this_meal_price = MealPrice(&menu.meals[i]);
    if (this_meal_price > max_meal_price) {
      max_meal_price = this_meal_price;
      max_price_meal = &menu.meals[i];
    }
    if (this_meal_price < min_meal_price) {
      min_meal_price = this_meal_price;
      min_price_meal = &menu.meals[i];
    }
  }
  printf("Maximum price meal id: %d, price: %.2f rub.\n", 
         max_price_meal->id, max_meal_price);
  printf("Minimum price meal id: %d, price: %.2f rub.\n", 
         min_price_meal->id, min_meal_price);
 
  struct Course* max_calority_course = &menu.meals[0].courses[0];
  for (i = 0; i < menu.meal_count; ++i)
    for (j = 0; j < menu.meals[i].course_count; ++j)
      if (menu.meals[i].courses[j].caloricity >
          max_calority_course->caloricity)
        max_calority_course = &menu.meals[i].courses[j];
  printf("Max calority course is %s, price %.2f, kkal: %.1f",
         max_calority_course->name, max_calority_course->price,
         max_calority_course->caloricity);
 
  DeleteMenu(&menu);
 
  return 0;
}