The effect of edge weights on clique weights

Suppose the edges of the complete r-graph on n vertices are weighted with real values. For r≤k≤n, the weight of a k-clique is the sum of the weights of its edges. Given the largest gap between the weights of two distinct edges, how small can the largest gap between the weights of two distinct k-cliques be? We answer this question precisely.