思路:将左边最大和右边最大的合并,再放入重新考虑,知道没有人为止,因为可以有多个圆桌,所以可以简化为下列代码。
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<queue>
#include<stack>
#include<cstring>
#include<string>
//#include<map>
typedef long long LL;
using namespace std;
int l[100010], r[1000010], n;
LL sum = 0;
int main()
{
cin >> n;
sum = n;
for (int i = 0; i < n; i++)cin >> l[i] >> r[i];
sort(l, l + n); sort(r, r + n);
for (int i = 0; i < n; i++)sum += max(l[i] , r[i]);
cout << sum;
}