Submission #2892075

---

Source Code Expand

#include<iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <tuple>
#include <cmath>
#include <queue>
#include <map>


using namespace std;


int main()
{
  int a, b, c;
  // long c = 0;
  int d[3];
  int e[3];
  priority_queue<int> v;
  for (int i = 0; i < 3; i++) {
    cin >> d[i];
    v.push(d[i]); 
  }
  for (int i = 0; i < 3; i++) {
    e[i] = v.top();
    v.pop();
  }


  cout << e[1]<<endl;


  // cout << c << endl;
  return 0;
}

Submission Info

Judge Result