1466B - Last minute enhancements i have tried to solve this with a time complexity of O(n) even with Fast_IO too it gave me an TLE ~~~~~ for t in range(0, int(input())): n = int(input()) ar = list(map(int, input().split())) ar.sort()

op = [ar[0]]

for i in ar[1:]:
    op.sort()
    if op[-1] == i:
        op.append(i+1)
    else:
        op.append(i)

# print(ar)
# print(op)
print(len(set(op)))
# print()

~~~~~ my solution 168486304

can I have a better solution ???