How would you sort a list of weight objects in O(n(logn)^2) time if the scale you use to weigh the object has a 1/3 change of malfunctioning?

I've thought about this problem for a while. I think it has to be a randomized algorithm and we use repetition to get a high probability of it succeeding. I think we can prove that the algorithm is correct using Chernoff bounds.