Advertisement
tomalikem

Knapsack

Jun 7th, 2018
92
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.63 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. struct Item {
  6.     double value, weight;
  7. };
  8.  
  9. struct Knapsack {
  10.     Item* it;
  11.     int n;
  12.     double cap;
  13. };
  14.  
  15. double max_profit(Knapsack k)
  16. {
  17.     int profit=0;
  18.     int p;
  19.     for(int i=0;i<k.n;i++)
  20.     {
  21.         p=k.it[i].value/k.it[i].weight;
  22.         if(p>profit)profit=p;
  23.     }
  24.     return profit*k.cap;
  25. }
  26.  
  27. int main() {
  28.     int N, cap;
  29.     cin >> N >> cap;
  30.     Knapsack k;
  31.     k.n = N;
  32.     k.cap = cap;
  33.     k.it = new Item[N];
  34.     for (int i=0; i<N; i++) {
  35.         cin >> k.it[i].value >> k.it[i].weight;
  36.     }
  37.  
  38.     cout << max_profit(k);
  39.     delete[] k.it;
  40. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement