【贪心+背包】BZOJ1334 [Baltic2008]Elect

Description

Solution

Code

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=1e5+5;

int a[maxn],f[maxn];
int n,sum,ans;

int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]),sum+=a[i];
sort(a+1,a+n+1);

f[0]=1;
for(int i=n;i>=1;i--)
for(int j=sum/2+a[i];j>=a[i];j--)
if(f[j-a[i]]) f[j]=1,ans=max(j,ans);
printf("%d\n",ans);
return 0;
}