Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- struct Item {
- double value, weight;
- };
- struct Knapsack {
- Item* it;
- int n;
- double cap;
- };
- double max_profit(Knapsack k)
- {
- int profit=0;
- int p;
- for(int i=0;i<k.n;i++)
- {
- p=k.it[i].value/k.it[i].weight;
- if(p>profit)profit=p;
- }
- return profit*k.cap;
- }
- int main() {
- int N, cap;
- cin >> N >> cap;
- Knapsack k;
- k.n = N;
- k.cap = cap;
- k.it = new Item[N];
- for (int i=0; i<N; i++) {
- cin >> k.it[i].value >> k.it[i].weight;
- }
- cout << max_profit(k);
- delete[] k.it;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement