请编写一个函数void fun(int tt[M][N],int pp[N])，tt指向一个M行N列的二维数组，求出二维数组每列中最小元素，并依次放入pp所指一维数组中。

#include <iostream>
#include<iomanip>
using namespace std;
#define  M  3
#define  N  4
/*求出二维数组每列中最小元素，并依次放入pp所指一维数组中*/
void  fun(int tt[M][N], int pp[N])
{
	int i, j, min;
	for (i = 0; i < N; i++)
	{
		for (j = 0; j < M - 1; j++)
		{
			if (tt[j][i] < tt[j + 1][i])
			{
				min = tt[j][i];
				tt[j + 1][i] = tt[j][i];
			}
			else
				min = tt[j + 1][i];
		}
		pp[i] = min;
	}
}
int main()
{
    int t[M][N] = { {22,45, 56,30 } ,{19,33, 45,38}, {20,22, 66,40} };
    int  p[N], i, j, k;
    cout << "The original data is : \n";
    for (i = 0; i < M; i++)
    {
        for (j = 0; j < N; j++)
            cout << t[i][j] << "  ";
        cout << "\n";
    }
    fun(t, p);
    cout << "\nThe result  is:\n";
    for (k = 0; k < N; k++) cout << setw(4) << p[k];
}