BOJ 20976 - 2 番目に大きい整数 (The Second Largest Integer) [C++]

문제

링크

풀이

#include <algorithm>
#include <iostream>
using namespace std;
 
void solve(void) {
  int a, b, c; cin >> a >> b >> c;
 
  cout << a + b + c - min({a, b, c}) - max({a, b, c});
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}