问题描述:
#include<stdio.h>
struct work{
int key;
int num;
int judge;
}d[100];
int main(){
int a[7]={6,3,8,4,5,6,9};
int b[7]={7,4,9,2,2,3,7};
int c[7];
for(int i=0;i<7;i++){
if(a[i]<b[i]){
d[i].key=a[i];
d[i].judge=0;//s1上时间短,排在前面
}
else{
d[i].key=b[i];
d[i].judge=1;
}
d[i].num=i;
}
for(int i=0;i<7;i++){
for(int j=i;j<6;j++){
if(d[j].key>d[j+1].judge){
int keyy,numm,judgee;
keyy=d[j].key;numm=d[j].num;judgee=d[j].judge;
d[j].num=d[j+1].num;d[j].key=d[j+1].key;d[j].judge=d[j+1].judge;
d[j+1].key=keyy;d[j+1].judge=judgee;d[j+1].num=numm;
}
}
}
int m=0;
int n=6;
for(int i=0;i<7;i++){
if(d[i].judge==0) c[m++]=d[i].num;
else c[n--]=d[i].num;
}
printf("作业顺序为:");
for(int i=0;i<7;i++) {
printf("%d ",c[i]);
}
int s1=a[c[0]];
int sum=s1+b[c[0]];
for(int i=1;i<7;i++){
s1+=a[c[i]];
if(s1>sum){
sum=s1+b[c[i]];
}
else sum+=b[c[i]];
}
printf("\n%d",sum);
return 0;
}