美团CodeM2018资格赛赛题官方版本详解（一）——下单

第一题：下单

解题思路

标程

#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;

void Assert(bool t){if(!t){printf("data error\n");exit(0);}}

int n,m,i,j,k,ans;
int a[15],t[15],b[15],c[15];

int calc1()
{
	int i,sum=0;
	for(i=1;i<=n;++i)if(t[i])sum+=a[i]*80;else sum+=a[i]*100;
	return sum;
}

int calc2()
{
	int i,sum=0,ans;
	for(i=1;i<=n;++i)sum+=a[i];
	ans=sum;
	for(i=1;i<=m;++i)if(sum>=b[i])ans=min(ans,sum-c[i]);
	return ans*100;
}

int main()
{
	scanf("%d%d",&n,&m);
	Assert(1<=n&&n<=5);
	Assert(1<=m&&m<=5);
	for(i=1;i<=n;++i)scanf("%d%d",&a[i],&t[i]),Assert(1<=a[i]&&a[i]<=100&&0<=t[i]&&t[i]<=1);
	for(i=1;i<=m;++i)scanf("%d%d",&b[i],&c[i]),Assert(1<=c[i]&&c[i]<b[i]&&b[i]<=1000);;
	ans=min(calc1(),calc2());
	printf("%d.",ans/100);
	if(ans%100<10)printf("0");
	printf("%d\n",ans%100);
}