1103开心的金明 内存超限

#include<iostream>

#include<math.h>

using namespace std;

int main()

{

int n, i, j,k,m,t,max;

cin >>max>> n;

m = pow(2, n);

int **p=NULL ;

p = new int* [m];

for (i = 0; i < m; i++)

{

p[i] = new int[n];

}

for (i = 0; i < m; i++)

{

t = i;

for (j = n - 1; j >= 0; j--)

{

p[i][j] = t % 2;

t = t / 2; 

}

}

int* h;

h = new int[m];

for (i = 0; i < m; i++)

{

h[i] = 0;

}

int* f={};

f = new int[m];

for (i = 0; i < m; i++)

{

f[i] = 0;

}

int** p1;

p1 = new int* [n];

for (i = 0; i < n; i++)

{

p1[i] = new int[2];

}

for (i = 0; i < n; i++)

for (j = 0; j < 2; j++)

{

cin >> p1[i][j];

}

for (i = 0; i < m; i++)

{

for (j = 0; j < n; j++)

{

h[i] += p[i][j] * p1[j][0];

}

if (h[i] <= max)

{ 

for (k = 0; k < n; k++)

    f[i] += p[i][k] * p1[k][0] * p1[k][1];

}

}

for (i = 0; i < m; i++)

{

if (f[0] < f[i])

f[0] = f[i];

}

cout << f[0];

delete []f;

delete []h;

delete []p1;

delete []p;

return 0;

}