Provide a heuristic solution to the following packing problem

See more:

C#

Python

Provide a heuristic solution to the following packing problem:
We have a strip with a width of one meter and an infinite length
We want to place the given shapes in the form of circle, square and rectangle on it so that they do not overlap and use the least length of tape.
Provide a heuristic solution for it and implement your solution and test it on the attached dataset.

Explanation that in the attached data set, C means circle, B means square and R means rectangle, and the numbers in front of them specify their size in centimeters.

What I have tried:

Excuse me I'm Anvar_v and i want you help me.


Provide a heuristic solution to the following packing problem:
We have a strip with a width of one meter and an infinite length
We want to place the given shapes in the form of circle, square and rectangle on it so that they do not overlap and use the least length of tape.
Provide a heuristic solution for it and implement your solution and test it on the attached dataset.

Explanation that in the attached data set, C means circle, B means square and R means rectangle, and the numbers in front of them specify their size in centimeters.