Submit solution

Points:
3 (partial)

Time limit:
0.5s

C#
0.75s

Haskell
1.0s

Java
0.6s

Python
1.0s

Memory limit:
3M

C#
28M

Haskell
6M

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

Everyone: read the question

very carefullyme: still WAs everything

This comment is hidden due to too much negative feedback. Click here to view it.

Wow. I must say, I really enjoyed this problem. I hate my lack of common sense.

If you can't find the solution in the problem statement via rereading, looking at your output will help.

This comment is hidden due to too much negative feedback. Click here to view it.

This comment is hidden due to too much negative feedback. Click here to view it.

this question's a straight up troll lmao

This comment is hidden due to too much negative feedback. Click here to view it.

I just solved it, and everyone is correct, you need to nit pick certain bits of information and think of a solution. Phew, that took me awhile, I enjoyed this problem! Thumbs up to the creator.

This question took me longer then it should have.

Tip: you don't need to

store inputsyou don't need to save memoryhow come it doesn't work?????????????? no inputs

Lol this was actually way easier than I thought

Learning to read really does come in handy sometimes

To anyone still having problems with this question, read the part about permutations carefully. Consider the implications of having one, and the answer will come really easily.

Easier than it looks

Omg the way this question phrases the goal is just down right dirty. gawd XD

OMG, finally got there with python - and learned something new which I guess is the point :)

How did you get over the memory error?

As stated below, read the question

very carefully.Why is my solution outputting wrong answers? It was fine until I made a change to save memory.

make some of your own test cases, read the question , be sure not to miss out on any

`important properties`

of this question, and the reason you are getting`WA`

is simply because your program is incorrectGot it. But there still is a memory issue

Can someone tell me what's wrong with my java code? Thanks.

Regarding the question, it states that you are given a

permutationof the integers to . This is the best hint I can give you: don't try to sort the integers or store it in an array. The memory limit for java is 3 MB.The point of this question is to read it very, very carefully. Good luck!

I thought List Minimum (Easy) would be easy, but no.

This comment is hidden due to too much negative feedback. Click here to view it.

I keep on getting

`Memory Error`

.That means you are using too much memory, read the question carefully

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.