AOJ 0565 - Lunch
いつかに解いた気がするのです.
#include <iostream> #include <algorithm> int main(){ const int INF = 10000000; int min_p = INF, min_j = INF; for(int i=0;i<5;i++){ int n; std::cin >> n; if(i < 3) min_p = std::min(min_p, n); else min_j = std::min(min_j, n); } std::cout << min_p + min_j - 50 << std::endl; }