ru
Feedback
Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

Открыть в Telegram

Main channel https://t.me/Coding_000 Contact Admin 👉 @ILOVEU_143 for booking your exam slots Web- https://coding000.github.io/Projects/ 💯% clearance in any placement exams OffCampus -https://t.me/Offcampus_000 Discussion- https://t.me/exams_discussion

Больше
3 346
Подписчики
-324 часа
-167 дней
-5130 день
Архив постов
Take screenshot of my channel and share to large groups if u need more answers

#include <bits/stdc++.h> using namespace std; int main() {     int n,k;     cin>>n>>k;     int a[n];     for(int i=0;i<n;i++){         cin>>a[i];     } @Coding_000     int cnt=1;     int ans=0;     while(cnt<k){        sort(a,a+n,greater<int>());        for(int i=0;i<k;i++){            a[i]-=1;        }               for(int i=0;i<n;i++){            if(a[i]==0)cnt++;        }        ans++;     }     cout<<ans<<endl;     return 0; } //answer of joe code //language - c++

No one is sharing 😑 Share as much as you can!!! Answers are ready!! Kindly SHARE to get answers 😎

only our channel getting the fast and crt answers pls show some love and support us 😊✅

If above code passed send me screenshot of test cases @ILOVEU_000 Then I'll send second code