76 lines
1.9 KiB
C
76 lines
1.9 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <ctype.h>
|
|
#define LINE_SIZE 100
|
|
#define MAXIT 100
|
|
|
|
|
|
struct pizza{
|
|
char name[LINE_SIZE];
|
|
float prize;
|
|
};
|
|
|
|
|
|
int read_pizza(struct pizza *item){
|
|
char line_1[LINE_SIZE]; //nazov
|
|
char line_2[LINE_SIZE];//cena
|
|
|
|
if (fgets(line_1,LINE_SIZE,stdin)==NULL) return 0;//ak nie je vstup return o
|
|
if (fgets(line_2,LINE_SIZE,stdin)==NULL) return 0;
|
|
|
|
line_1[strcspn(line_1,"\n")] = '\0';//odstrani znak rovnakeho riadku
|
|
line_2[strcspn(line_2,"\n")] = '\0';
|
|
|
|
float price = 0.0;
|
|
if (sscanf(line_2, "%f", &price)!=1||price<=0) return 0;//kontrola vystupy
|
|
|
|
strcpy(item->name, line_1);// skopiruje nazov do struktury
|
|
item->prize = price;
|
|
|
|
return 1;
|
|
}
|
|
|
|
|
|
int read_pizza_list(struct pizza* list){
|
|
int counter = 0;
|
|
for(int i = 0; i<MAXIT;i++){ // cyklus nacitava vsetky pizzy
|
|
struct pizza item; //pomocna premenna
|
|
memset(&item,0,sizeof(struct pizza)); // vydelime pamat
|
|
int r = read_pizza(&item); //nacitajme jednu pizzu
|
|
if (r){ // ak nacitana
|
|
memcpy(&list[counter], &item, sizeof(struct pizza)); // kopirujeme z itemu do naseho menu
|
|
counter++; // cnt+1
|
|
} else { // ak nie
|
|
break;
|
|
}
|
|
}
|
|
return counter;
|
|
}
|
|
|
|
|
|
int compare_pizza (const void * a, const void * b){
|
|
const struct pizza *p1 = (const struct pizza *)a; // pointer na prvu pizzu
|
|
const struct pizza *p2 = (const struct pizza *)b; // pointer na druhu
|
|
|
|
if(p1->prize<p2->prize) return -1;
|
|
if(p1->prize>p2->prize) return 1;
|
|
|
|
return strcmp(p1->name,p2->name); // ak cena bude ta ista, porovname mena
|
|
|
|
}
|
|
|
|
|
|
int main(){
|
|
struct pizza list[MAXIT];
|
|
memset(list,0,sizeof(list)); // vydelime pamat pre menu
|
|
|
|
int count = read_pizza_list(list);
|
|
|
|
qsort(list,count,sizeof(struct pizza), compare_pizza); //triedenie menu
|
|
for (int i = 0;i<count;i++){
|
|
printf("%s\n%.6f\n",list[i].name,list[i].prize);
|
|
}
|
|
return 0;
|
|
}
|