传送门:http://codeforces.com/contest/1060/problem/D
感觉比c题好想多了,因为环可以有随便多个,自己和自己也可以成环,那就 记录l,和 r 然后两个数组sort一下,按下标配对就好了,配对取大的那个,所有对求和,然后加上n个人就是答案,代码如下。
#include <bits/stdc++.h> using namespace std; typedef long long LL; inline int read(){ int f = 1, x = 0;char ch = getchar(); while (ch > '9' || ch < '0'){if (ch == '-')f = -f;ch = getchar();} while (ch >= '0' && ch <= '9'){x = x * 10 + ch - '0';ch = getchar();} return x * f; } const int maxn = 1e5 + 10; int l[maxn],r[maxn]; int main(){ int n = read(); for (int i = 0; i < n; ++i) { l[i] = read(); r[i] = read(); } sort(l,l+n); sort(r,r+n); LL ans = 0; for (int i = 0; i < n; ++i) { ans += max(l[i],r[i]); } cout << ans + n << endl; return 0; }