Uva Problem 11727 - Cost Cutting Solution

Problem Link

Uva Problem 11727 - Cost Cutting Solution

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;

    for(int i=1;i<=t;i++)
    {
        int a[4];
        cin>>a[0]>>a[1]>>a[2];

        sort(a,a+3);
        cout<<"Case "<<i<<": "<<a[1]<<endl;
    }
   return 0;
}