Minimum Cost to sort an array either ascending or descending
Given an array of integers ,the cost to change an element is abs(newvalue — initialvalue) .Determine the minimum cost to sort the array either ascending or descending .
1<=n<=1e3 1<=arr[i]<=1e9
I couldnt find its solution after so much brainstorming can anyone help me out with its solution?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
LIT2021015_AYUSH | 2024-04-27 22:46:36 | 80 | ||
| en2 |
|
LIT2021015_AYUSH | 2024-04-27 21:15:40 | 82 | Tiny change: ' solution?' -> ' solution?\n\n' | |
| en1 |
|
LIT2021015_AYUSH | 2024-04-27 21:13:43 | 368 | Initial revision (published) |
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 173 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | pajenegod | 145 |
