View Code of Problem 124

#include<cstdio>
#include<iostream>
#include<cstring>

using namespace std;

int main(){
	int n,a,b,c,tc,count=0;
	long long m;
	scanf("%d",&tc);
	for(count=1;count<=tc;count++){
		scanf("%d%lld",&n,&m);
		scanf("%d%d%d",&a,&b,&c);
		long long maxx,minn;
		if(m%2){
			maxx = (n-m-1) * max(a, max(b,c)) + max(m*b, (m/2)*(a+c)+max(b, min(a,c)));
		}else{
			maxx = (n-m-1) * max(a, max(b,c)) + max(m*b, (m/2)*(a+c));
		}

		long long k = n - m;
		if(k%2){
			minn = (m-1) * min(a, min(b,c)) + min(k*b, (k/2)*(a+c)+min(b, max(a,c)));
		}else{
			minn = (m-1) * min(a, min(b,c)) + min(k*b, (k/2)*(a+c));
		}
		printf("Case #%d: %lld %lld\n",count,maxx,minn);
	}
	return 0;
}