zzz

#include <iostream>
#include <iomanip>
#include <stdlib.h>
using namespace std;
int minim( int a, int b)
{
    int min = a;
    if (min>b)min=b;
    return min;
}
int maxim( int a, int b)
{
    int maxi = a;
    if (maxi<b) maxi=b;
    return maxi;
}
int main()
{
    int vvod=0;
    cin>>vvod;
    int a11=0,a12=0,a21=0,a22=0,a31=0,a32=0,a41=0,a42=0,a51=0,a52=0, a61=0,a62=0,a71=0,a72=0,a81=0,a82=0,a91=0,a92=0,a101=0,a102=0;

    {               a11=1,a12=1,a21=3,a22=3,a31=7,a32=1,a41=2,a42=2,a51=3,a52=1,a61=4,a62=4,a71=5,a72=1,a81=4,a82=2,a91=5,a92=3,a101=6,a102=2;
    }
    int f[10][2]=
    {
        {a11,a12},
        {a21,a22},
        {a31,a32},
        {a41,a42},
        {a51,a52},
        {a61,a62},
        {a71,a72},
        {a81,a82},
        {a91,a92},
        {a101,a102}
    };
    cout<<"Massiv dannyh:\n";
    cout<<setw(6)<<"|"<<setw(5)<<"F1 |"<<setw(5)<<"F2 |"<<endl;
    for (int i=0;i<10;i++)
    {
        cout<<" E"<<setw(2)<<i+1<<" |";
        for (int j=0;j<2;j++)
        {
            cout<<setw(3)<<f[i][j]<<" |";
        }
        cout<<"\n";
    }
    cout<<"............................................\n";
    cout<<"\nMinimaxnyi kriterii prinyztiya resheniya:\n";
    int f1[10][3]=
    {
        {a11,a12,minim(a11,a12)},
        {a21,a22,minim(a21,a22)},
        {a31,a32,minim(a31,a32)},
        {a41,a42,minim(a41,a42)},
        {a51,a52,minim(a51,a52)},
        {a61,a62,minim(a61,a62)},
        {a71,a72,minim(a71,a72)},
        {a81,a82,minim(a81,a82)},
        {a91,a92,minim(a91,a92)},
        {a101,a102,minim(a101,a102)}
    };
    int max=0;
    cout<<setw(6)<<"|"<<setw(5)<<"F1 |"<<setw(5)<<"F2 |"<<setw(5)<<"min|"<<endl;
    for (int i=0;i<10;i++)
    {
        cout<<" E"<<setw(2)<<i+1<<" |";
        for (int j=0;j<3;j++)
        {
            cout<<setw(3)<<f1[i][j]<<" |";
            if (max<f1[i][2]) max=f1[i][2];
        }
        cout<<endl;
    }
    cout<<setw(15)<<"MAX"<<"|"<<setw(3)<<max<<" |"<<endl;
    int k=0;
    cout<<"Optimalnoe Reshenie:\n";
    for (int i=0;i<10;i++)
    {
        for (int j=2;j<3;j++)
        {
            if (max==f1[i][2])
            {
                cout<<" E"<<setw(2)<<i+1<<" |";
                cout<<setw(3)<<f1[i][0]<<" |"<<setw(3)<<f1[i][1]<<" |"<<endl;
                k++;
            }
        }
    }
    cout<<"Kol-vo Optimal Reshenie = "<<k<<endl;