Fractional knapsack//used greedy approach

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string,int> psi;
typedef priority_queue<int> pqmax;
typedef priority_queue<int,vector<int>,greater<int>> pqmin;
typedef unordered_map<int,int> mii;
typedef unordered_map<long long,long long> mll;
typedef unordered_map<string,int> msi;
typedef unordered_map<char,int> mci;
typedef unordered_set<int> si;
typedef unordered_set<long long> sll;
typedef unordered_set<string> ss;
typedef unordered_set<char> sc;
typedef map<int,int> ormii;
typedef map<long long,long long> ormll;
typedef map<string,int> ormsi;
typedef map<char,int> ormci;
typedef set<int> orsi;
typedef set<long long> orsll;
typedef set<string> orss;
typedef set<char> orsc;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;

#define FOR(i, a, b) for (auto i=a; i<=(b); i++)
#define FORd(i,b,a) for (int i =b; i >= a; i--)
#define sortinc(v)  sort(v.begin(),v.end())
#define sortdec(v)  sort(v.rbegin(),v.rend())
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define fi first
#define se second
#define ins insert

const int MOD = 1000000007;
int m(ll k) {return k%MOD;}
//type functions here

float findMaxProfit(vi &v,vi &w,int &cap)
{
    float profit=0;
    int n=v.size();
    map<float,pair<int,int>>m;
    while(n--){
        //cout<<n<<endl;
       m[w[n]/(float)v[n]]=make_pair(v[n],w[n]);
    }
    int count=0;
    for(auto x:m)
    {
        auto y=x.second.first;
        auto z=x.second.second;
        if(z>cap)
        break;
        cap-=z;
        //cout<<y<<endl;
        profit+=y;
        count++;
    }

    while(count--) m.erase((*m.begin()).first);
     float rem=1.0;

    rem=cap/(float)((*(m.begin())).second.second);
    if(cap!=0)
    profit+=(rem*((*(m.begin())).second.first));
    //cout<<rem<<endl;
    return profit;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tc=1;
    //cin>>tc;
    FOR(ww,1,tc)
    {
       vi v={1,2,3,4},w={3,7,4,6};
       int cap=10;
       cout<<findMaxProfit(v,w,cap)<<endl;

    }
    return 0;
}