You are trying to fit maximum number of objects into a storage area.\n\nThe storage area is a one-dimensional cave (with opening on one end), divided into equal-length segments of varying heights h_0, ..., h_n.\n\nObjects are also of equal length and varying heights h_0, ..., h_k. Only one object can fit into one segment, and that is of course the height of the object is no larger than the height of the segment. Once the object is put in a segment, it renders inaccessible the rest of the storage space behind the blocked segment.\n\nObjects are carried into the storage by means of a forklift, which means that if we want to put store it in a given segment, it must not only fit in that segment, but also in all previous segments (and of course no previous segment can be already occupied).\n\nStorage space segment heights:\n3, 4, 2, 3\n\nObjects heights:\n5, 1, 3, 3, 4\n\nans : 3\n\nI tried sorting object heights, but failed in few cases.\ncan someone suggest solution to this problem?

You are trying to fit maximum number of objects into a storage area.\n\nThe storage area is a one-dimensional cave (with opening on one end), divided into equal