{"id":19010,"date":"2021-02-01T22:17:52","date_gmt":"2021-02-01T14:17:52","guid":{"rendered":"http:\/\/www.zufubiji.com\/19010.html"},"modified":"2021-02-01T22:17:52","modified_gmt":"2021-02-01T14:17:52","slug":"%e6%a6%82%e8%bf%b0%e8%84%b8%e7%9b%b8%e7%9b%ae%e6%a0%87%e7%bc%96%e7%a8%8b%e8%ae%be%e8%ae%a1%e7%9a%84%e4%b8%89%e5%a4%a7%e7%89%b9%e7%82%b9","status":"publish","type":"post","link":"http:\/\/www.zufubiji.com\/19010.html","title":{"rendered":"\u6982\u8ff0\u8138\u76f8\u76ee\u6807\u7f16\u7a0b\u8bbe\u8ba1\u7684\u4e09\u5927\u7279\u70b9"},"content":{"rendered":"
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
\tvector<int> v(3);
\tfor (int &n : v)
\t\t\u7b54cin >> n;
\tsort(v.begin(), v.end());
\tfor (int &n : v)
\t\tcout << n << ends;
\treturn 0;
}<\/pre>\n<\/p>\n
\u2460\u7956\u7236\u7b14\u8bb0\u2460\u6587\u7ae0\u5185\u5bb9\u4e0d\u53ef\u81ea\u4e3b\u8f6c\u622a\uff0c\u8fdd\u53cd\u8005\u5fc5\u8ffd\u8d23\uff01<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"