blob: afb23f7aaca313895cd86280cb1853e49f27a6a7 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
// https://kth.kattis.com/problems/kth.alginda.quicksort
#![feature(test)]
use std::io::{stdin, stdout, Read, Write};
mod radix_sort;
use radix_sort::radix_sort;
fn main() {
let mut buffer = String::new();
stdin().lock().read_to_string(&mut buffer).unwrap();
let mut p = buffer.bytes();
let mut n = 0;
while let Some(b) = p.next() {
if b == b' ' {
break;
}
n *= 10;
n += (b - b'0') as usize;
}
let mut xs = vec![0; n];
for i in 0..n {
let mut neg = false;
let mut x = 0i32;
while let Some(b) = p.next() {
match b {
b' ' | b'\n' => break,
b'-' => neg = true,
b => {
x *= 10;
x += (b - b'0') as i32;
}
}
}
if neg {
x = -x;
}
xs[i] = x;
}
radix_sort(&mut xs);
let mut p = buffer.len() - 1;
let b = unsafe { buffer.as_mut_vec() };
b[p] = b'\n';
p -= 1;
for i in (0..n).rev() {
let x = xs[i];
let neg = x < 0;
let mut x = if neg { (-x) as u32 } else { x as u32 };
loop {
b[p] = (x % 10) as u8 + b'0';
p -= 1;
x /= 10;
if x == 0 {
break;
}
}
if neg {
b[p] = b'-';
p -= 1;
}
if i > 0 {
b[p] = b'\n';
p -= 1;
}
}
p += 1;
stdout().lock().write(&b[p..]).unwrap();
}
|
