思路:
这题是道数论推理题
连续的几个数不能表示的最小数 = 答案 + 1
要卡longlong
简称koala
C o d e Code Code:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
typedef long long ll;
using namespace std;
ll n,ans;
ll a[100001];
int main ()
{
scanf ("%lld", &n);
for (int i = 1; i <= n; ++i)
scanf("%lld", &a[i]);
sort (a + 1, a + 1 + n);
for (int i = 1; i <= n; ++i)
if (ans + 1 >= a[i]) ans += a[i];//连续的几个数不能表示的最小数
printf("%lld", ans + 1);
return 0;
}