Help to solve it(Помогите)

Question

Create two structs:

struct Pricelist item which has:
- ID // (int)
- name // наименование товара (string)
- price //цена (double)

struct Pricelist which has:
- ID // (int)
- Firm // фирма выпускающая прайслист (char *)
- date // дата составления прайс-листа (char*)
- number of products(int) // количество продуктов
- items(pointer to Pricelist item`s struct). //указатель на объекты Pricelist item

Your task is to show all firms, which contains the given item in the given range sorted by price in descending order.
If you have more than one pricelist from the same firm, then you should output the most recent one.
Have to: use structs, pointers and dynamic memory allocation.

Input:
n (how many pricelists) [2 <= n <= 10]
n-times:
pricelist id
pricelist issuer firm
date
number of products
all information about pricelist items
searched_item range(in format of xxx-yyy)

Output:
All firms, which contains the given item in the given range
Input:
5
13501 Food-master 15.06.17 4
1 Kefir 305.34
2 Milk 250.50
3 Yogurt 78.56
4 Ice-cream 95.61

13502 Adal 14.07.18 3
1 Kefir 301.34
2 Milk 258.67
3 Yogurt 90.15

13503 Emir 17.09.17 4
1 Kefir 310.41
2 Milk 261.48
3 Yogurt 79.15
4 Butter 230.54

13504 Domik_v_derevne 19.11.17 2
1 Kefir 304.4
2 Milk 245.45

13505 Food-master 18.12.17 3
1 Kefir 310.34
2 Ice-cream 97.61
3 Yogurt 79.56

Yogurt 57-85

Output:

13503 Emir 17.09.17
13505 Food-master 18.12.17

Answer 1

Azat Malgazhdar
Our community will surely help you!
Just show us your attempt! Don't ask for readymade queries/homework queries!

Follow community guidelines -
https://www.sololearn.com/Discuss/1316935/?ref=app

Hope you understand 👍

Answer 2

Do it yourself
Let us know if you have any confusion/problem