Knapsack recursive

#include<fstream>
#include <vector>
#include <iostream>
using namespace std;

vector <int> v{0,5,3,5,3,2};



//53532

int result = 0;
int KnapSack(int n, int capacity)
{
    if((n==0)  || (capacity==0))
        return 0;
    else if(v.at(n) > capacity)
        result = KnapSack(n-1, capacity);
    else {
        int temp1 = KnapSack(n-1,capacity);
        int temp2 = v.at(n)+ KnapSack(n-1,capacity-v.at(n));
        result = max(temp1, temp2);
    }
    return result;

}

int main(){
    int res = KnapSack(5,23);
    cout <<res;
}