Description：

Solution：

Code：

#include<algorithm>

#include<iostream>

#include<cstdlib>

#include<cstdio>

#include<cmath>

#include<map>

#include<queue>

#include<cctype>

#include<cstring>

using namespace std;

#define R register

inline int rd()

{

	R int res = 0,f = 1;

	R char c = getchar();

	while(!isdigit(c))

	{

		if(c == '-')f = -1;

		c = getchar();

	}

	while(isdigit(c))

	{

		res = (res << 1) + (res << 3) + c - '0';

		c = getchar();

	}

	return res * f;

}

int n,m,mina,minb,k;

#define MAXN 1010

typedef long long ll;

int v[MAXN][MAXN];

ll s[MAXN][MAXN];

ll sum(int r1,int c1,int r2,int c2)

{

	return s[r2][c2] - s[r1 - 1][c2] - s[r2][c1 - 1] + s[r1 - 1][c1 - 1];

}

struct state

{

	int r1,c1,r2,c2;

	ll v;

	bool operator < (const state &b)const

	{

		if(v == b.v)

		{

			return (r1==b.r1?(c1==b.c1?(r2==b.r2?c2<b.c2:r2<b.r2):c1<b.c1):r1<b.r1);

		}

		return v > b.v;

	}

};

map<state,bool> vis;

priority_queue<state> q;

void insert(int r1,int c1,int r2,int c2)

{

	q.push((state){r1,c1,r2,c2,sum(r1,c1,r2,c2)});

	return;

}

int main()

{

	scanf("%d%d%d%d%d",&n,&m,&mina,&minb,&k);

	for(int i = 1;i <= n;++i)

		for(int j = 1;j <= m;++j)

			v[i][j] = rd();

	for(int i = 1;i <= n;++i)

		for(int j = 1;j <= m;++j)

			s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + v[i][j];

	for(int i = 1;i <= n - mina + 1;++i)

		for(int j = 1;j <= m - minb + 1;++j)

			insert(i,j,i + mina - 1,j + minb - 1);

	state s;

	for(int w = 1;w <= k;++w)

	{

		while(!q.empty() && vis[q.top()])q.pop();

		s = q.top();q.pop();vis[s] = true;

		int r1 = s.r1,c1 = s.c1,r2 = s.r2,c2 = s.c2;

		if(r1 != 1)insert(r1 - 1,c1,r2,c2);

		if(r2 != n)insert(r1,c1,r2 + 1,c2);

		if(c1 != 1)insert(r1,c1 - 1,r2,c2);

		if(c2 != m)insert(r1,c1,r2,c2 + 1);

	}

	cout << s.v << endl;

	return 0;

}