古法解题法

#include <bits/stdc++.h>
using namespace std;
int main(){
    int f[110];    
    string d;
    cin >> f[0]>> f[1] >>f[2] >>d;
    sort(f, f + 3);
    int a = f[0], b=f[1] ,c=f[2];
    if(d=="ABC") cout << a << " "<< b << " " << c;
    else if (d=="ACB") cout << a << " "<< c << " "<< b;
    else if (d=="BAC") cout << b << " " << a << " " << c;
    else if (d=="BCA") cout << b << " "<< c << " "<< a;
    else if (d=="CAB") cout << c << " "<< a << " "<< b;
    else if (d=="CBA") cout << c << " "<< b << " "<< a;
    return 0;
}