UVa 11727 - Cost Cutting * (sort the 3 numbers and get the median)

Link: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=117&page=show_problem&problem=2827
Sol: 

#include <iostream>
	#include <algorithm>
	#include <vector>
	using namespace std;
	int main() {
	int n,cnt,a[3];
	cin >> n;
	cnt = 0;
	for(int i=0;i<n;i++){
	cnt++;
	cout << "Case " << cnt << ": ";
	cin >> a[0] >> a[1] >> a[2];
	vector<int> v(a,a+3);
	sort(v.begin(),v.end());
	cout << v[1] << endl;
	}
	return 0;
	}