[알고리즘] 백준 15953 - 상금 헌터

#include <iostream>
using namespace std;

int N;
int A[6] = {1,2,3,4,5,6};
int AC[6] = {500,300,200,50,30,10};
int B[6] = {1,2,4,8,16};
int BC[6] = {512,256,128,64,32};	

int main(){	
    cin >> N;
    int a, b;
    for(int i=0; i<N; i++){
        cin >> a >> b;
        int tmp = 0;
        int tmpA = 0, tmpB = 0;
        
        for(int j=0; j<sizeof(A)/sizeof(A[0]); j++){
            tmpA += A[j];
            if(a <= tmpA && a != 0){
                tmp += AC[j];
                break;
            }
        }
        
        for(int j=0; j<sizeof(B)/sizeof(B[0]); j++){
            tmpB += B[j];
            if(b <= tmpB && b != 0){
                tmp += BC[j];
                break;	
            }			
        }
        
        cout << tmp * 10000 <<"\n";
    }
    return 0; 
}