feat: feat: add solutions to lc problem: No.3413

Author: rom.spiridonov

solution/3400-3499/3413.Maximum Coins From K Consecutive Bags/Solution.cpp

@@ -15,6 +15,7 @@ class Solution {
         int64_t cost() const { return int64_t(value) * (end - start + 1); }
         int64_t cost(int len) const { return int64_t(value) * len; }
     };
+
 public:
     long long maximumCoins(vector<vector<int>>& coins, int k) {
         int N = int(coins.size());