#include <bits/stdc++.h> using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; if(a>b){ swap(a,b); } if(a>c){ swap(a,c); } if(b>c){ swap(b,c); } cout<<a<<" "<<b<<" "<<c; return 0; }

#include<iostream> #include<cmath> using namespace std; int main(){ int a,b,c,sum; cin >> a >> b >> c; sum=a+b+c; int maxn,minn; cout<< min(a,min(b,c))<<" "<<sum-min(a,min(b,c))-max(a,max(b,c))<<" "<<max(a,max(b,c)); }

#include<iostream> using namespace std; int main() { double a,b,c,s; cin>>a>>b>>c; if(a<b) { s=a; a=b; b=s; } else if(b<c) { s=b; b=c; c=s; } else if(c<a) { s=c; c=a; a=s; } cout<<a; cout<<" "; cout<<b; cout<<" "; cout<<c; return 0; }

二叉搜索树绝对是最简单的做法！！新手们一定要来试一试（maybe）。

#include<bits/stdc++.h> using namespace std; int main(){ int a[3],z; for(int i = 0;i< 3;i++){ cin >>a[i]; } if(a[0] > a[1]){ z = a[0]; a[0] = a[1]; a[1] = z; } if(a[0] > a[2]){ z = a[0]; a[0] = a[2]; a[2] = z; } if(a[1] > a[2]){ z = a[1]; a[1] = a[2]; a[2] = z; } for(int j = 0;j < 3;j++){ cout<<a[j]<<" "; } return 0; }

#include<bits/stdc++.h> using namespace std; int main(){ int a[3]; cin>>a[0]>>a[1]>>a[2]; sort(a,a+3); cout<<a[0]<<" "<<a[1]<<" "<<a[2]; return 0; }

#include<bits/stdc++.h> using namespace std; int main(){ int a,b,c; cin>>a>>b>>c; vector<int> arr(3); arr[0]=a; arr[1]=b; arr[2]=c; sort(arr.begin(),arr.end()); for(int i=0;i<3;i++){ cout<<arr[i]<<" "; } return 0; }

#include<iostream> using namespace std; int main(){ int a,b,c; cin >> a >> b >> c; if(a>b){ swap(a,b); } if(b>c){ swap(b,c); } if(a>b){ swap(a,b); } cout << a << " " << b << " " << c; return 0; }