actually, this guy in hdoj ( dummies ), because I did not expect this would not have timed out, so I wrote it according to his own ideas. (Originally intended to be written using hash)
Problem: 1425 (SORT) Judge Status: Accepted <br/> runid: 5629392 language: C ++ Author: ssun <br/> code render status: rendered by hdoj C ++ code render version 0.01 beta </P> <p> # include <iostream> <br/> # include <algorithm> <br/> using namespace STD; </P> <p> const int n = 1000010; <br/> int arr [N]; </P> <p> int main () <br/>{< br/> int n, m; <br/> while (scanf ("% d", & N, & M )! = EOF) <br/>{< br/> memset (ARR, 0, sizeof (ARR); <br/> int I; <br/> for (I = 0; I <n; I ++) <br/> scanf ("% d", & arr [I]); <br/> sort (ARR, arr + n); <br/> I = n-1; <br/> while (M> 0) <br/>{< br/> If (M --! = 1) <br/> printf ("% d", arr [I --]); <br/> else <br/> printf ("% d ", arr [I --]); <br/>}< br/> printf ("\ n"); <br/>}< br/> return 0; <br/>}