Submission #345771

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <list>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <utility>
#include <complex>
#include <memory>
#include <functional>

using namespace std;

#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < (int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define pb push_back
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef pair<long,long> pll;
typedef long long ll;


int main(int argc, char* argv[])
{
	int a,b,c;

	cin >> a >> b >> c;

	if(b <= a && a <= c || c <= a && a <= b){
		cout << a << endl;
		return 0;
	}else if(a <= b && b <= c || c <= b && b <= a ){
		cout << b << endl;
		return 0;
	}else if(a <= c && c <=  b || b <= c && c <= a ){
		cout << c << endl;
		return 0;
	}
}

Submission Info

Judge Result