We address the problem of packing of a set of
weighted rectangles into a single rectangle so that the total weight of the packed rectangles is maximized. We consider the case of large resources, that is, the single rectangle is
times larger than any rectangle to be packed, for small
> 0. We present an algorithm which finds a packing of a subset of rectangles with the total weight at least (1 −
) times the optimum. The running time of the algorithm is polynomial in
. As an application we present a (2 +
)-approximation algorithm for a special case of the advertisement placement problem.