Nyoj 41-Three numbers from small to large (STL-to-sort (a, a+n) ascending)

41-three numbers from small to large sort

Memory limit: 64MB time limit: 3000ms special Judge:no
accepted:31 submit:44

Title Description:

Now to write a program that implements a three-digit sort of function

Input Description:

Enter a three positive integer

Output Description:

Sort three positive integers for input

Sample input:Copy

20 7 33

Sample output:

7 20 33

Analysis:
Sort directly using the sort function in the STL library

C + + code implementation (AC):
　　

#include <iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<cmath>#include<stack>#include<map>#include<queue>#include<Set>using namespacestd;intMain () {intt[3]; scanf ("%d%d%d", &t[0], &t[1], &t[2]); Sort (T, T+3);  for(inti =0; I <2; ++i) printf ("%d", T[i]); printf ("%d\n", t[2]); return 0;}

Nyoj 41-Three numbers from small to large (STL-to-sort (a, a+n) ascending)