2020牛客寒假算法基础集训营2
题意:
坑点:
用long long
代码:
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#define Pll make_pair
using namespace std;
typedef long long ll;
const int maxn=2e5+50;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
const int phi=1e9+6;
int p[maxn];
int main()
{
ll a,b,c,x,y,z;
scanf("%lld%lld%lld%lld%lld%lld",&a,&b,&c,&x,&y,&z);
ll ans=0;
ans+=min(a,y)+min(b,z)+min(c,x);
printf("%lld\n",ans);
return 0;
}