题意：略。
将li,ri排序，然后大的和大的取max，就行。
#include <iostream> #include <cstdio> #include <cmath> #include <algorithm> #include <vector> #include <iomanip> #include <cstring> #include <map> #include <queue> #include <set> #include <cassert> #include <stack> #include <bitset> #define mkp make_pair #define err cout<<"err"<<endl using namespace std; const double EPS=1e-8; typedef long long lon; typedef unsigned long long ull; typedef pair<int,int> pii; const lon SZ=100010,SSZ=SZ*SZ,APB=4,one=1; const lon INF=0x3f3f3f3f,mod=1000000007; lon n,a[SZ],b[SZ]; void init() { cin>>n; for(int i=1;i<=n;++i) { cin>>a[i]>>b[i]; } sort(a+1,a+1+n); sort(b+1,b+1+n); lon res=n; for(int i=1;i<=n;++i) { res+=max(a[i],b[i]); } cout<<res<<endl; } void work() { } void release() { } int main() { std::ios::sync_with_stdio(0); //freopen("d:\\1.txt","r",stdin); lon casenum; //cin>>casenum; //cout<<casenum<<endl; //for(lon tim=1;tim<=casenum;++tim) //for(lon tim=1;cin>>n;++tim) { //cout<<"Case #"<<tim<<": "; init(); work(); release(); } return 0; }