Pagini recente » Cod sursa (job #694972) | Cod sursa (job #2463642) | Cod sursa (job #425360) | Cod sursa (job #1852631) | Cod sursa (job #75105)
Cod sursa(job #75105)
#include <fstream.h>
int main(){
int rand,coloane,r,c,k=0,min,ind,t;
ofstream out;
fstream in ;
out.open("elimin.out");
in.open("elimin.in");
in >>rand>>coloane>>r>>c;
int numar[rand][coloane],tempr[rand],tempc[coloane];
for(int i=0;i<rand;i++){
tempr[i]=0;
for(int p=0;p<coloane;p++)
{
if(i==0)
tempc[p]=0;
in >>numar[i][p];
tempc[p]=tempc[p]+numar[p][i];
tempr[i]=tempr[i]+numar[i][p];
}
}
t=rand;
while(k<r){
min=tempr[0];
ind=0;
for(int i=0;i<t;i++)
if(min>tempr[i]){
ind=i;
min=tempr[i];
}
t=t-1;
k=k+1;
for(int i=ind;i<t;i++){
for(int p=0;p<coloane;p++)
numar[i][p]=numar[i+1][p];
tempr[i]=tempr[i+1];
}
}
rand=t;
k=0;
t=coloane;
while(k<c){
min=tempc[0];
ind=0;
for(int i=0;i<t;i++)
if(min>tempc[i]){
ind=i;
min=tempc[i];
}
k=k+1;
for(int i=ind;i<t;i++){
for(int p=0;p<rand;p++)
numar[p][i]=numar[p][i+1];
tempc[i]=tempc[i+1];
}
t=t-1;
}
coloane=t;
k=0;
for(int i=0;i<rand;i++)
for(int p=0;p<coloane;p++)
k=k+numar[i][p];
out <<k;
out.close();
in.close();
return 0;
}