Programming Beauty---Tape file storage optimization

To define the nth file on a tape, you need to go through the previous n-1 file. Suppose there are n files on the tape, l[0],l[1], ..., l[n-1] and the probability of being accessed is p[0],p[1],..., p[n-1], how do you arrange for the best storage order on tape?

The thinking process is: from the assumption that the probability is equal, the length is different, we can get the best access efficiency according to the file length from short to long to store the file on tape. Then, assuming the same length, the probabilities vary, and it is best to rank files from large to small by access probability. Best, the lengths and probabilities are different, and the values of p[i]/l[i] are the best order of storage, ranging from large to small.

Programming Beauty---Tape file storage optimization