UESTC 1263 The Desire of Asuna （贪心）

题目链接：http://acm.uestc.edu.cn/#/problem/show/1263

思路：贪心的思想，排序，然后优先拆环数少的链子，然后查看是否能连接完成就行了。

ac代码：

#include<stdio.h>#include<math.h>#include<string.h>#include<stack>#include<queue>#include<vector>#include<iostream>#include<algorithm>#define MAXN 1010000#define LL long long#define ll __int64#define INF 0x7fffffff#define mem(x) memset(x,0,sizeof(x))#define PI acos(-1)#define mod 1000000007using namespace std;int a[MAXN];int main(){int n,i;while(scanf("%d",&n)!=EOF){for(i=0;i<n;i++)scanf("%d",&a[i]);sort(a,a+n);int cnt=n;int ans=0;for(i=0;i<n;i++){if(cnt-a[i]-1<1){ans+=cnt-1;break;}else{    ans+=a[i];cnt=cnt-a[i]-1;}}printf("%d\n",ans);}return 0;}