알고리즘
2455 [시뮬레이션1]
ok4u
2019. 1. 7. 10:36
#include<stdio.h>
int max(int a, int b){
if(a>b) return a;
else return b;
}
int main(){
int a[4];
int b[4];
int temp[4];
int sum[4];
for(int i=0; i<4; i++){
scanf("%d",&a[i]);
scanf("%d",&b[i]);
temp[i] = b[i] - a[i];
}
sum[0] = temp[0];
sum[1] = temp[0] + temp[1];
sum[2] = temp[0] + temp[1] + temp[2];
sum[3] = temp[0] + temp[1] + temp[2] + temp[3];
for(int i=0; i<4; i++){
sum[0] = max(sum[0],sum[i]);
}
printf("%d",sum[0]);
}