//class implemented

/*

struct Item{

    int value;

    int weight;

};

*/

class Solution

{

    public:

    static bool cmp(pair<double, Item> a, pair<double, Item> b){

        return a.first>b.first;

    }

    //Function to get the maximum total value in the knapsack.

    double fractionalKnapsack(int w, Item a[], int n)

    {

        // Your code here

        vector<pair<double, Item>> v;

        for(int i=0; i<n; i++){

        double perunitvalue=(a[i].value*1.0/a[i].weight);

           v.push_back({perunitvalue, a[i]});

        }

       sort(v.begin(), v.end(), cmp);

       double totalvalue=0;

       for(int i=0; i<n; i++){

           if(v[i].second.weight>w){

             totalvalue+=w*v[i].first;

                w=0;

           }

           else{

             totalvalue+=v[i].second.value;

             w=w-v[i].second.weight;

           }

       }

        return totalvalue;

    }

};