比大小排序的代码，虽然确实写的有点累赘，但还是很想知道哪里有问题，感觉没有达到应有的逻辑效果，代码如下

#include
using namespace std;
int main(){
int a,b,c,M,N,P,x,y;
cout<<"enter a,b,c:";
cin>>a>>b>>c;
M=a>b?b:a;
N=c>b?b:c;
P=M>c?c:M;
if(P==a)
if(P==b)
{
x=a>c?c:a;
y=a>c?a:c;
}
else
{
x=M;
y=a>b?a:b;
}
else
{

                          x=N;
              y=c>b?c:b;
}
cout<<"由小到大排序:"<<P<<','<<x<<','<<y<<endl;
return 0;

}

p==a 改成 p!=a

#include<iostream>
using namespace std;

int main(){
    int a,b,c,M,N,P,x,y;
    cout<<"enter a,b,c:";
    cin>>a>>b>>c;
    M=a>b?b:a;
    N=c>b?b:c;
    P=M>c?c:M;
    if(P!=a)
        if(P==b)
        {
            x=a>c?c:a;
            y=a>c?a:c;
        }
        else
        {
            x=M;
            y=a>b?a:b;
        }
    else
    {
        x=N;
        y=c>b?c:b;
    }
    cout<<"由小到大排序:"<<P<<','<<x<<','<<y<<endl;
    return 0;
}