알고리즘28 :: BOJ_2979_트럭주차

package backjun모음;
 
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
/*
 * 
 * 하나의 점으로 본것은 큰 실수
 * 범위로 체크 해야 했다. 
 */
 
public class backjun_2979_트럭주차 {
 
    
    public static void main(String[] args) throws Exception {
        // TODO Auto-generated method stub
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        
        int one = Integer.parseInt(st.nextToken());
        int two = Integer.parseInt(st.nextToken());
        int three = Integer.parseInt(st.nextToken());
        
        int[] arr = new int[101];
        int min=Integer.MAX_VALUE, max = Integer.MIN_VALUE;
        for(int i=0; i<3; i++) {
            st = new StringTokenizer(br.readLine());
            int first = Integer.parseInt(st.nextToken());
            int second = Integer.parseInt(st.nextToken());
        
            for(int z=first; z<second; z++) {
                arr[z]+=1;
            }
            
            if(min>first)
                min = first;
            if(max<second)
                max = second;
        }
        //시작 과 끝 정해놓고
        
        int sum =0;
        for(int i=min; i<=max; i++) {
            if(arr[i] == 1) {
                sum+=(arr[i]*one);
            }else if(arr[i] ==2) {
                sum+=(arr[i]*two);
            }else if(arr[i] ==3) {
                sum+=(arr[i]*three);
            }
        }
        System.out.println(sum);
        
        
        
        
        
    }
 
}