Submit solution

Points:
3 (partial)

Time limit:
0.5s

Java
1.0s

Python
2.0s

Memory limit:
3M

Java
3M

Python
12M

Authors:

Problem type

##### Brute Force Practice 1 — Easy Version

Given a permutation of the integers , output the permutation after it has been sorted.

#### Input Specification

The first line will contain the integer .

The next line will contain integers, a permutation of the integers .

#### Output Specification

The sorted permutation on a single line.

#### Sample Input

```
3
2 1 3
```

#### Sample Output

`1 2 3`

## Comments

The biggest problem in this question is to fully understand the question

Tip for anyone that's having issues with this question: reread the problem statement.

I thought this was supposed to be easy. Not so strict on time and memory please?

Well, seems like I got here before CopyPastePolice.

Hi loltrollkill, on behalf of the DMOJ committee, we'd like to remind you that copying code is not respected in this community. We ask that you refrain from copying submissions off of Github. Several of your submissions have been investigated, and those that are found to be copied will be deleted. The investigation will continue, and similarly, those that are copied will also be purged. You can message me on Slack if you would like to (appeal in some sort of fashion?)

.

ohh jonathan got em

Can solve a 40 pointer and a 30 pointer but can't solve a 3 pointer, hmmmm...

Agreed, can we get CPP in here?

It's supposed to be done in constant memory. And time is also not a problem with the intended solution.