I need an algorithm ( With C++ code ) for the following problem :

I have some covers of size : (2.4,1.2) meter (Width, Height). I want to cover different size of field with it (example: (9,5) meter (width, height) , the covers can be rotated as we like.

I just want to find the number minimum number of the covers required to cover the fields of different sizes.