题解 | 最大的两个数

#include <iostream>
using namespace std;

int main() {
    int a[10][10];
    int b[10][10];
    int temp;
    int x = 1;
    while (x == 1) {
        for (int i = 0; i < 4; i++) {
            for (int j = 0; j < 5; j++) {
                cin >> a[i][j];
                b[i][j] = a[i][j];
            }
        }
        for (int i = 0; i < 5; i++) {
            for (int j = 0; j < 4; j++) {
                for (int k = 0; k < 4 - j - 1; k++) {
                    if (a[k][i] > a[k + 1][i]) {
                        temp = a[k][i];
                        a[k][i] = a[k + 1][i];
                        a[k + 1][i] = temp;
                    }
                }
            }
        }
        int ipos1, ipos2;
        for (int i = 0; i < 5; i++) {
            //for (int k = 0; k < 4; k++) {
                for (int m = 0; m < 4; m++) {
                    if (a[2][i] == b[m][i]) {
                        //cout<<"a[2][i]="<<a[2][i]<<endl;
                        ipos1 = m;
                        //cout << "ipos1=" << ipos1 << endl;
                    }
                }
                for (int m = 0; m < 4; m++) {
                    if (a[3][i] == b[m][i]) {
                        //cout<<"a[3][i]="<<a[3][i]<<endl;
                        ipos2 = m;
                        //cout << "ipos2=" << ipos1 << endl;
                    }
                }
                
                if (ipos1 < ipos2) {
                    a[2][i]=a[2][i];
                    a[3][i]=a[3][i];
                } else {
                    int temp = a[2][i];
                    a[2][i] = a[3][i];
                    a[3][i] = temp;
                }
            //}
        }
        for (int i = 2; i < 4; i++) {
            for (int j = 0; j < 5; j++) {
                cout << a[i][j];
                if (j != 4) {
                    cout << ' ';
                }
            }
            cout << endl;
        }

        x = 0;
    }

    return 0;
}
// 64 位输出请用 printf("%lld")