class Solution {
public:
    int maxProfit(vector<int>& prices) {
      int l = prices.size();
      int pro=0;
      int minp=INT_MAX;
      for(int i=0;i<l;i++)
      {
        if(prices[i]<minp)minp=prices[i];
        else if(prices[i]-minp>pro)
        {
          pro = prices[i]-minp;
        }

    }
      return pro;
    }
};