Pagini recente » Cod sursa (job #3160785) | Cod sursa (job #2461725) | Cod sursa (job #1496673) | Cod sursa (job #2697437) | Cod sursa (job #118674)
Cod sursa(job #118674)
#include<stdio.h>
int s,s1,s2,i,j,a[100][100],b,sc[101],sl[101],n,m,r,c,p[100];
int main(){
FILE *f=fopen("elimin.in","r");
fscanf(f,"%d%d%d%d",&n,&m,&r,&c);
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
fscanf(f,"%d",&a[i][j]);
sl[i]+=a[i][j];
s+=a[i][j];
}
p[sl[i]]=i;
}
fclose(f);
//ultimile r sume si il q 0;
i=1;
int aux=n;
while(i<=n){
for(j=2;j<=n;j++){
if(sl[i]>sl[j]){
b=sl[i];
sl[i]=sl[j];
sl[j]=b;
}
i++;
}
n--;
i=1;
j=2;
}
int s1=0,k=aux;
for(i=1;i<=r;i++){
s1+=sl[k];
for(j=1;j<=m;j++){
a[p[sl[k]]][j]=0;
}
k--;
}
for(j=1;j<=m;j++){
for(i=1;i<=aux;i++){
sc[j]+=a[i][j];
}
}
aux=m;
while(i<=m){
for(j=2;j<=m;j++){
if(sc[i]>sc[j]){
b=sc[i];
sc[i]=sc[j];
sc[j]=b;
}
i++;
}
m--;
i=1;
j=2;
}
FILE *g=fopen("elimin.out","w");
fprintf(g,"%d",s-(s1+s2));
fclose(g);
return 0;
}