Q).Maximum possible number of monsters you can defeat?
=>Introduction:
While playing an RPG game, you were assigned to complete one of the hardest quests in this game. There are n monsters you'll need to defeat in this quest. Each monster i is described with two integer numbers - poweri and bonusi. To defeat this monster, you'll need at least poweri experience points. If you try fighting this monster without having enough experience points, you lose immediately. You will also gain bonusi experience points if you defeat this monster. You can defeat monsters in any order. The quest turned out to be very hard - you try to defeat the monsters but keep losing repeatedly. Your friend told you that this quest is impossible to complete. Knowing that, you're interested, what is the maximum possible number of monsters you can defeat? (Question difficulty level: Hardest)
=> Input:
The first line contains an integer, n, denoting the number of monsters.
The next line contains an integer, e, denoting your initial experience.
Each line i of the n subsequent lines (where 0 ≤ i < n) contains an integer, poweri, which represents power of the corresponding monster.
Each line i of the n subsequent lines (where 0 ≤ i < n) contains an integer, bonusi, which represents bonus for defeating the corresponding monster.
=> Sample cases:
******************** C++ CODE ***********************
#include<iostream>
#include<map>
using namespace std;
int main(){
int nMon,nExp;
cin>>nMon;
cin>>nExp;
map<int,int> monster;
int arr[nMon],monBon;
for(int i=0; i<nMon; i++){
cin>>arr[i];
}
for(int i=0; i<nMon; i++){
cin>>monBon;
monster[arr[i]]=monBon;
}
//Implementation
map<int,int> :: iterator iter;
int value,valBon,counter=0;;
for(iter=monster.begin(); iter!= monster.end(); iter++){
value=(*iter).first;
valBon=(*iter).second;
if(nExp>=value){
nExp=nExp+valBon;
counter++;
}else{
break;
}
}
cout<<"OUTPUT : "<<counter<<endl;
}
=> Output :
Comments
Post a Comment