문제 링크입니다: www.acmicpc.net/problem/18330
18330번: Petrol
The input consists of two lines. The first line contains an integer n (0 ⩽ n ⩽ 200), specifying the amount of petrol that will be used in the next month. The second line contains an integer k (0 ⩽ k ⩽ 360), showing the quota left in Mahya’s fuel
www.acmicpc.net
간단한 구현 문제였습니다.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| #include <algorithm> | |
| using namespace std; | |
| const int QUOTA = 60; | |
| const int QUOTA_PRICE = 1500; | |
| const int EXTRA_PRICE = 3000; | |
| int main(void) | |
| { | |
| ios_base::sync_with_stdio(0); | |
| cin.tie(0); | |
| int n, k; | |
| cin >> n >> k; | |
| int result = min(n, QUOTA + k) * QUOTA_PRICE + max(n - k - QUOTA, 0) * EXTRA_PRICE; | |
| cout << result << "\n"; | |
| return 0; | |
| } |
개발환경:Visual Studio 2017
지적, 조언, 질문 환영입니다! 댓글 남겨주세요~
반응형
'알고리즘 > BOJ' 카테고리의 다른 글
| 백준 18411번 試験 (0) | 2021.03.27 |
|---|---|
| 백준 18408번 3 つの整数 (0) | 2021.03.27 |
| 백준 18005번 Even or Odd? (0) | 2021.03.27 |
| 백준 17903번 Counting Clauses (0) | 2021.03.26 |
| 백준 17874번 Piece of Cake! (0) | 2021.03.26 |