We are given two arrays \ncost = [1,2,3,4,5]\nsize = [1,1,2,3,3]\n\n0<=cost[i]<=10^9\n0<=size[i]<=10^4\n\nWe need to find minimum cost such that all sizes are different. \nWe can increase size of a element one time for cost[i] .\n\nI solved it by: sort by cost then use a set to find next available size but asked to faced TLE.

We are given two arrays \ncost = [1,2,3,4,5]\nsize = [1,1,2,3,3]\n\n0<=cost[i]<=10^9\n0<=size[i]<=10^4\n\nWe need to find minimum cost such that all sizes are d