Поменять местами min и max элемент в массиве

#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include <set>
#include <queue>
#include <list>
#include <cstdio>
#include <cstdlib>
#include <vector>
#define ll long long
#define FOR(i,n) for(int (i) = 0; (i) < (n); (i)++)
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    const int N = 4, M = 4;
    int min = 2^31-2;
    int mini, minj;
    int matrix[N][M];
    FOR(i,N)
    FOR(j,M)
    {
    cin>>matrix[i][j];
    if (matrix[i][j]<min) {min = matrix[i][j]; mini = i; minj = j;}
    }
    cout<<"Min element: "<<min<<"; Raspolojenie : ("<<mini+1<<":"<<minj+1<<")";
}

#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include <set>
#include <queue>
#include <list>
#include <cstdio>
#include <cstdlib>
#include <vector>
#define ll long long
#define FOR(i,n) for(int (i) = 0; (i) < (n); (i)++)
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    const int N = 4, M = 4;
    int max = -2^31-2;
    int min = 2^31-2;
    int mini, minj;
    int maxi, maxj;
    int matrix[N][M];
    FOR(i,N)
    FOR(j,M)
    {
    cin>>matrix[i][j];
    if (matrix[i][j]<min) {min = matrix[i][j]; mini = i; minj = j;}
    if (matrix[i][j]>max) {max = matrix[i][j]; maxi = i; maxj = j;}
    }
    int tmp = matrix[mini][minj];
    matrix[mini][minj] = matrix[maxi][maxj];
    matrix[maxi][maxj] = tmp;
    cout<<"After modification:"<<endl;
    FOR(i,N)
    {
    FOR(j,M)
    {
    cout<<matrix[i][j]<<" ";
    }
    cout<<endl;}
}

#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include <set>
#include <queue>
#include <list>
#include <cstdio>
#include <cstdlib>
#include <vector>
#define ll long long
#define FOR(i,n) for(int (i) = 0; (i) < (n); (i)++)
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    const int N = 4, M = 4;
    int matrix[N][M];
    int summ_krat_3 = 0;
    ll proiz_krat_3 = 1;
    int count = 0;
    FOR(i,N)
    FOR(j,M)
    {
    cin>>matrix[i][j];
    }
    cout<<"Chisla, kratnye 3:"<<endl;
    FOR(i,N)
    FOR(j,M)
    {
    if (matrix[i][j]%3==0) {cout<<matrix[i][j]<<" "; summ_krat_3+=matrix[i][j]; proiz_krat_3*=matrix[i][j]; count++;}
    }
    cout<<endl;
    cout<<"Kol-vo elementov krat. 3 : "<<count<<"\n Summa chisel krat. 3: "<<summ_krat_3<<"\n Proizvedenie chisel krat. 3: "<<proiz_krat_3;
}

#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include <set>
#include <queue>
#include <list>
#include <cstdio>
#include <cstdlib>
#include <vector>
#define ll long long
#define FOR(i,n) for(int (i) = 0; (i) < (n); (i)++)
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    const int N = 4, M = 4;
    int matrix[N][M];
    int summ_chet = 0, summ_nechet = 0;
    FOR(i,N)
    FOR(j,M)
    {
    cin>>matrix[i][j];
    if (i%2==0) summ_chet+=matrix[i][j];
    if (j%2!=0) summ_nechet+=matrix[i][j];
    }
    cout<<summ_chet<<" X "<<summ_nechet<<endl;
    cout<<"X = ";
    if (summ_chet>summ_nechet) cout<<">"; else 
    if (summ_chet<summ_nechet) cout<<"<"; else cout<<"=";
}