[카카오 코드 페스티벌 2018 예선 A] 상금헌터

BOJ 15953번

https://www.acmicpc.net/problem/15953

#include <iostream>
#include <queue>
#include <cstdio>
#include <vector>
#include <cstring>
#include <string>
#include <math.h>
#include <algorithm>
 
using namespace std;
 
int T = 0;
 
vector<pair<int, int> > money_2017;
vector<pair<int, int> > money_2018;
 
int findMoney(int start, int end)
{
    int sum = 0;
 
    for (int i = 0; i < 6; i++)
    {
        int m = money_2017[i].first;
 
        if (start <= m)
        {
            sum += money_2017[i].second;
            break;
        }
    }
 
    if (start == 0) sum = 0;
 
    bool stop = false;
 
    if (end == 0) stop = true;
 
    if (!stop)
    {
        for (int i = 0; i < 5; i++)
        {
            int m = money_2018[i].first;
 
            if (end <= m)
            {
                sum += money_2018[i].second;
                break;
            }
        }
    }
 
    return sum;
}
 
void init()
{
    // 2017
    money_2017.push_back({ 1, 5000000 });
    money_2017.push_back({ 3, 3000000 });
    money_2017.push_back({ 6, 2000000 });
    money_2017.push_back({ 10, 500000 });
    money_2017.push_back({ 15, 300000 });
    money_2017.push_back({ 21, 100000 });
 
    // 2018
    money_2018.push_back({ 1, 5120000 });
    money_2018.push_back({ 3, 2560000 });
    money_2018.push_back({ 7, 1280000 });
    money_2018.push_back({ 15, 640000 });
    money_2018.push_back({ 31, 320000 });
}
 
int main(void)
{
    int f = 0, s = 0;
 
    init();
 
    scanf("%d", &T);
 
    for (int tc = 1; tc <= T; tc++)
    {
        scanf("%d %d", &f, &s);
 
        printf("%d\n", findMoney(f, s));
    }
 
    return 0;
}