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

法1

思路

整个不一样的： max({a,b,c……}) 和 min({a,b,c……}) 可以在一堆数里面找最大和最小。 中间的值可以用三个数之和减最小的和最大的。

法2

sort大法好。

法3

我们知道priority_queue<int,vector<int>,greater<int> > 会得到小根堆，每个头节点都是最小的元素，所以可以利用于此来排序。

法4

冒泡排序。

code

#include<bits/stdc++.h>
using namespace std;
int a,b,c;
void fa1(){//max、min
	cin>>a>>b>>c;
	cout<<min({a,b,c})<<" "<<(a+b+c-max({a,b,c})-min({a,b,c}))<<" "<<max({a,b,c});
}
void fa2(){//sort
	int a[3];
	cin>>a[0]>>a[1]>>a[2];
	sort(a,a+3);
	cout<<a[0]<<" "<<a[1]<<" "<<a[2];
}
void fa3(){//堆排序
	cin>>a>>b>>c;
	priority_queue<int,vector<int>,greater<int> > pq;
	pq.push(a),pq.push(b),pq.push(c);
	while(pq.size()){
		cout<<pq.top()<<" ";
		pq.pop();
	}
}
void fa4(){//冒泡
	cin>>a>>b>>c;
	if(a>b)	swap(a,b);
	if(b>c)	swap(b,c);
	if(a>c)	swap(a,c);
	cout<<a<<" "<<b<<" "<<c;
}
int main(){
	fa4();
}

555

555

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

#include<bits/stdc++.h> using namespace std; int main() { double a,b,c,d,e,f; cin>>a>>b>>c; d=max(max(a,b),c); f=min(min(a,b),c); e=a+b+c-d-f; cout<<f<<" "<<e<<" "<<d<<endl; return 0; }

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

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

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

#include<bits/stdc++.h> using namespace std; int main() { int a,b,c,d,e; cin>>a>>b>>c; d=min(min(a,b),c); e=max(max(a,b),c); cout<<d<<" "<<a+b+c-d-e<<" "<<e; return 0; }

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

#include<bits/stdc++.h>
using namespace std;

int main()
{
 int a[3];
 scanf("%d%d%d",&a[1],&a[2],&a[0]);
 sort(a,a+3);
 cout<<a[0]<<" "<<a[1]<<" "<<a[2];
 return 0;
}

using namespace std;
int main()
{
	int a,b,c,t;
	cin>>a>>b>>c;
	if(a>b)
	{
		t=a;a=b;b=t;
	}
	if(a>c)
	{
		t=a;a=c;c=t;
	}
	if(b>c)
	{
		t=b;b=c;c=t;
	}
	cout<<a<<" "<<b<<" "<<c<<endl;
	return 0;
}

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

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