hdoj 5948 Thickest Burger

题目链接：Thickest Burger

题目大意：给你A,B分别为等腰三角形两条边，求三角形最大边长

题目思路：MAX（A,B）*2+MIN（A,B）就好了

#include <map>#include <set>#include <queue>#include <stack>#include <cmath>#include <vector>#include <cstdio>#include <cstring>#include <cstdlib>#include <iostream>#include <algorithm>using namespace std;typedef long long ll;int main(){    int t,a,b;    cin>>t;    while(t--){        cin>>a>>b;        cout<<max(a,b)*2+min(a,b)<<endl;    }    return 0;}