#159 | Minimize Max Distance to Gas Station | gfg potd | 22-05-2024 | GFG Problem of The Day

preview_player
Показать описание
🚀 Solving Geeks for Geeks Problem of the Day(POTD) in C++ | Minimize Max Distance to Gas Station | Intuition Explained🧠

🌐 Connect with Me:

💬 Have questions or suggestions? Drop them in the comments below! Let's learn and grow together. Happy coding! 👨‍💻

#GFG #POTD #geeksforgeeks #problemoftheday #c++
Рекомендации по теме
Комментарии
Автор

i tried it without binary search using sets can you tell me why my code is not working

double &stations, int k) {
double d;multiset<double>st;
for(int i=1;i<stations.size();i++){

}
while(k--){



st.erase(--(st.end()));

}

double result = *(st.rbegin());
return floor(result * 100) / 100;







}

nishant
Автор

Bhaiya compilation error dikhai de raha he

arnabghosh