Question

5
The Wealthy Move
Andy's college team is going to the sports fest in AIU to play a football match with their
coach. There are n players in Andy's team, numbered from 1 to n. The coach will know the
position of another team hence he tries to create a winning strategy. He positioned every
player in a sorted order according to the number of the player so that they may win. He has
to position players in such a way that it can't be understood by another team:
12
Hroma incore San499498aasas
Any player can swap with the player directly in front of him.
If the sorted order is formed then Andy's team will win otherwise they will lose. Prevent the
team from losing!!
14
15
18
Input Format
20
21
22
The First line contains numbers of players in team: N
The second fine contains n space separated integers denoting the number of each player.
Constraints
1=1045
1=A[i] <= n (All numbers from 1 to n present distinctly)
Output Format
Print bar aftatal manera and to norition than warn
5​

Answer 1

Answer:

Please give more points for this answer I'll definitely answer it

Answer 2

Answer:

We have to create an array where each player name is followed by its position number separated by a space.