fork download
  1. //Lib
  2. #include<cstdio>
  3. #include<cstring>
  4. #include<cstdlib>
  5. #include<cmath>
  6. #include<ctime>
  7.  
  8. #include<iostream>
  9. #include<algorithm>
  10. #include<vector>
  11. #include<string>
  12. #include<queue>
  13. #include<stack>
  14. #include<set>
  15. #include<map>
  16. using namespace std;
  17. //Macro
  18. #define rep(i,a,b) for(int i=a,tt=b;i<=tt;++i)
  19. #define drep(i,a,b) for(int i=a,tt=b;i>=tt;--i)
  20. #define erep(i,e,x) for(int i=x;i;i=e[i].next)
  21. #define irep(i,x) for(__typeof(x.begin()) i=x.begin();i!=x.end();i++)
  22. #define read() (strtol(ipos,&ipos,10))
  23. #define sqr(x) ((x)*(x))
  24. #define pb push_back
  25. #define PS system("pause");
  26. typedef long long ll;
  27. typedef pair<int,int> pii;
  28. const int oo=~0U>>1;
  29. const double inf=1e100;
  30. const double eps=1e-6;
  31. string name="", in=".in", out=".out";
  32. //Var
  33. int w[308],f[100008];
  34. int n,m,sum,ans;
  35. void Work()
  36. {
  37. scanf("%d",&n);
  38. rep(i,1,n)scanf("%d",w+i),sum+=w[i];
  39. sort(w+1,w+1+n,greater<int>());
  40. m=sum>>1;
  41. rep(i,1,n)drep(j,sum,w[i])
  42. {
  43. if(f[j-w[i]]+w[i]>f[j])
  44. {
  45. if(f[j-w[i]]<=m&&f[j-w[i]]+w[i]>m)f[j]=f[j-w[i]]+w[i];
  46. else if(f[j-w[i]]+w[i]<=m)f[j]=f[j-w[i]]+w[i];
  47. }
  48. ans=max(ans,f[j]);
  49. }
  50. cout<<ans<<endl;
  51. }
  52. int main()
  53. {
  54. // freopen((name+in).c_str(),"r",stdin);
  55. // freopen((name+out).c_str(),"w",stdout);
  56. // Init();
  57. Work();
  58. return 0;
  59. }
Not running #stdin #stdout 0s 0KB
stdin
Standard input is empty
stdout
Standard output is empty