Cod sursa(job #2077858)
Utilizator | Ionica Anda Maria Andaionica | Data | 28 noiembrie 2017 18:02:50 |
---|---|---|---|
Problema | Elimin | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.3 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elimin.in");
ofstream g("elimin.out");
struct elimin
{
int x,y;
}sl[7300];
int cmp(elimin a,elimin b)
{
return a.x<b.x;
}
int n,m,r,c,i,j,Max,v[7300][100],x[100],sc[101],s;
void back(int k)
{
int i;
for(i=x[k-1]+1;i<=k+c;i++)
{
x[k]=i;
s+=sc[i];
if(k==m-c)
Max=max(s,Max);
else
back(k+1);
s-=sc[i];
}
}
int main()
{
f>>n>>m>>r>>c;
if(n>=m)
{
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
f>>v[i][j];
sl[i].x+=v[i][j];
sl[i].y=i;
sc[j]+=v[i][j];
}
}
else
{
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
f>>v[j][i];
sl[j].x+=v[j][i];
sl[j].y=j;
sc[i]+=v[j][i];
}
int t=n;
n=m;
m=t;
t=r;
r=c;
c=t;
}
sort(sl+1,sl+n+1,cmp);
for(i=1;i<=r;i++)
for(j=1;j<=m;j++)
sc[j]-=v[sl[i].y][j];
back(1);
g<<Max;
return 0;
}