-
Notifications
You must be signed in to change notification settings - Fork 0
/
12157 - Tariff Plan.cpp
58 lines (58 loc) · 1.17 KB
/
12157 - Tariff Plan.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
/*
||-----------------------------------||
|| Rahat Khan Pathan ||
|| BGC Trust University ||
|| Department of CSE ||
||-----------------------------------||
*/
#include<bits/stdc++.h>
#define ll long long int
#define pub push_back
#define pi 3.14159265359
#define vll vector<ll>
#define All(X) (X).begin(),(X).end()
#define Unique(X) (X).erase(unique(All(X)),(X).end()))
#define fast ios_base::sync_with_stdio(0); cin.tie(0);
#define pi pair<ll,ll>
#define vpair vector<pair<ll,ll> >
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define minus cout<<-1<<endl
using namespace std;
ll ts=1;
void solve()
{
ll n,i;
cin>>n;
ll a,m=0,j=0;
for(i=0;i<n;i++)
{
cin>>a;
m+=(a/30+1)*10;
j+=(a/60+1)*15;
}
if(m>j)
{
cout<<"Case "<<ts<<": Juice "<<j<<endl;
}
else if(j>m)
{
cout<<"Case "<<ts<<": Mile "<<m<<endl;
}
else
{
cout<<"Case "<<ts<<": Mile Juice "<<m<<endl;
}
ts++;
}
int main()
{
fast;
ll t;
cin>>t;
while(t--)
{
solve();
}
return 0;
}