I know this problem is related to the greedy algorithm and max edges incomplete graph but can't come up with a solution.
You are given two numbers n and k:
n >= k
n is the total # of vertices
k is the maximum number of vertices that can form a complete graph per second
There are no edges initially
how many seconds does it take to form a complete graph of n vertices?