For this Question: There are N types of virus also each virus has an affinity equal to A[i]. You want to find the top 10 virus with the highest affinity.

Expected Time Complexity: O(N)First line contains an integer N.
Next line contains N space separated integers denoting elements of array.

Constraints
10 <= N <= 10^7
1 <= Ai <= 10^5Print the affinity of top 10 virus in sorted order.Sample Input 1:
10
1 2 3 4 5 6 7 8 9 10

Output 
1 2 3 4 5 6 7 8 9 10

Sample Input 2:
15
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Output 
6 7 8 9 10 11 12 13 14 15
, I have written this Solution Code: s = int(input())
arr = list(map(int,input().split()))
arr.sort()
print(*arr[s-10:s]), In this Programming Language: Python, Now tell me if this Code is compilable or not?