Luck Balance Hackerrank

-

Question Link  Click Here

C++ SOLUTION: 

int luckBalance(int k, vector<vector<int>> contests) {
    int i, j;
    sort(contests.begin(), contests.end(), greater<>());
    int max = 0 ;

    for (i = 0; i < contests.size(); i++) {
        if(k == 0 && contests[i][j + 1] == 1 ){
            max  = max -  contests[i][j];
        } else if (contests[i][j + 1] == 1) {
            k = k - 1;
            max = max + contests[i][j];

        }

        if (contests[i][j + 1] == 0){
            max = max = max + contests[i][j];
        }
    }

    return max ;

} 

Comments

Post a Comment

Popular posts from this blog

Infosys - Monster RPG GAME Sample Question Solution

-
Image
Monster RPG GAME - Solution #Infosys SOLUTION    #include <iostream> #include <map> #include <algorithm> using namespace std ; void game ( map < int , int > & g , int energy ) { int c = 0 ; for ( auto & itr : g ) { if ( energy >= itr. first ) { c++; energy = energy + itr. second ; } else { continue ; } } cout << c << endl ; } void mapping ( int p [], int b [], int n , int energy ) { int count ; map < int , int > m ; // mapping the key value pair from the array int i ; for ( i = 0 ; i < n ; i++) { m. insert ({ p [i], b [i]}); } for ( auto & itr : m) { cout << itr. first << " " << itr. second << endl ; } game (m, energy ) ; } int main () { int n ; cin >> n ; int i ; int p[n] ; int b[n] ; int e ; cin >> e ; // energy i have for (i = 0 ; i < n ; i++ ) { cin >> p[i] ...
Read more

Find the Leader C++

-
  #include<bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int arr[n]; int i; for (i = 0; i < n; i++) { cin >> arr[i]; } int max = arr[n - 1]; cout << arr[n - 1] << " "; for (i = n - 2; i >= 0; i--) { if (arr[i] >= max) { max = arr[i]; cout << max << " "; } } cout << '\n'; } return 0; }
Read more