#include<stdio.h>
int main()
{
    int a[3];
    for(int i=0;i<3;i++)
    {
        scanf("%d",&a[i]);
    }
    int tem=0;
    for(int i=0;i<2;i++)
    {
       for(int j=i;j<2;j++)
       {
        if(a[j]>a[j+1]){
            tem=a[j];
            a[j]=a[j+1];
            a[j+1]=tem;
        }
       }
    }
    for(int i=0;i<3;i++)
    {
        printf("%d ",a[i]);
    }
    return 0;
}
    

#include <stdio.h>
int main()
{
    int a,b,c,max,min,middle;
    scanf("%d %d %d",&a,&b,&c);
    max=a;min=a;middle=a;
    if (b>max)max=b;
    else if(min>b)min=b;
    if (c>max)max=c;
    else if(min>c)min=c;
    if(middle==max) middle=b;
    if(middle==min) middle=c;
    printf("%d %d %d",min,middle,max);
}

#include<stdio.h>
#include<iostream>	
#include<algorithm>
using namespace std; 	
int main()	
{
	int f[3];
	for(int i=0;i<3;i++)
	{
		cin>>f[i];
	}
	sort(f,f+4);
	cout<<f[1]<<" ";
	cout<<f[2]<<" ";
	cout<<f[3]<<" ";
	return 0;
}sort```无脑

#include<stdio.h> 
int main()
 { int x,y,z,t;
 scanf("%d %d %d",&x,&y,&z);
 if(x>y)
{ t=x; x=y; y=t; 
}if(x>z)
{ t=x; x=z; z=t; 
}
if(y>z)
{ t=y; y=z; z=t; 
} 
printf("%d %d %d",x,y,z); 
return 0;
 }

#include<stdio.h> int main() { int x,y,z,t; scanf("%d %d %d",&x,&y,&z); if(x>y){ t=x; x=y; y=t; }if(x>z){ t=x; x=z; z=t; }if(y>z){ t=y; y=z; z=t; } printf("%d %d %d",x,y,z); return 0; }

这道题用点小心思会做得没意义，还是自己练练的好

#include<iostream>
#include<algorithm>
using namespace std;
int arr[2];
int main() {
    cin >> arr[0] >> arr[1] >> arr[2];
    sort(arr, arr + 3);
    cout << arr[0] << " " << arr[1] << " " << arr[2];
}

#include<iostream> #include<algorithm> using namespace std;

int main(){ int a[3]; for(int i=0;i<3;i++){ cin>>a[i]; } sort(a,a+3); for(int i=0;i<3;i++){ cout<<a[i]<<" "; } }