(BOJ) 5543 상근날드

문제: https://www.acmicpc.net/problem/5543

소스코드:

#include <iostream> #include <vector> #include <map> #include <queue> #include <string> #include <algorithm> using namespace std; int a[3], b[2],result=4000; int main() { ios::sync_with_stdio(false); cin.tie(NULL), cout.tie(NULL); for (int i = 0; i < 3; i++) { cin >> a[i]; } for (int i = 0; i < 2; i++) { cin >> b[i]; } for (int i = 0; i < 3; i++) { for (int j = 0; j < 2; j++) { result = min(result, a[i] + b[j]); } } cout << result - 50; return 0; }