Wikioi 1014

#include<iostream>using namespace std;int main(){ int V,n,v[50],i,j,max; cin>>V>>n; int MAX=0,dp[50]; for(i=1;i<=n;i++) {  cin>>v[i];  if(v[i]<=V)dp[i]=v[i];  else dp[i]=0; } for(i=n-1;i>=1;i--) {  if(dp[i]==0)continue;  max=dp[i];  for(j=i+1;j<=n;j++)  {   if(dp[j]==0)continue;   if(dp[i]+dp[j]>max&&dp[i]+dp[j]<V+1)max=dp[i]+dp[j];  }  dp[i]=max;  if(max>MAX)MAX=max; } cout<<V-MAX; return 0;}//Copyright (C) 2014 wikioi user12923 All rights reserved