INFOSYS EXAM SOLUTIONS
🔥Guys plz Stop fearing for daily exams 📝 👨💻 @srksvk is here to help you all at lowest cost possible.💪 🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company 🔥Effort from our side = 💯 📱Main Channel: @coding_are 📱Tel I'd : @srksvk
Ko'proq ko'rsatish📈 Telegram kanali INFOSYS EXAM SOLUTIONS analitikasi
INFOSYS EXAM SOLUTIONS (@coding_are) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 13 544 obunachidan iborat bo'lib, Taʼlim toifasida 14 897-o'rinni va Hindiston mintaqasida 30 554-o'rinni egallagan.
📊 Auditoriya ko‘rsatkichlari va dinamika
невідомо sanasidan buyon loyiha tez o‘sib, 13 544 obunachiga ega bo‘ldi.
29 Iyul, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni 301 ga, so‘nggi 24 soatda esa 36 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.
- Tasdiqlash holati: Tasdiqlanmagan
- Jalb etish (ER): Auditoriya o‘rtacha 6.07% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 2.28% ini tashkil etuvchi reaksiyalarni to‘playdi.
- Post qamrovi: Har bir post o‘rtacha 820 marta ko‘riladi; birinchi sutkada odatda 308 ta ko‘rish yig‘iladi.
- Reaksiyalar va o‘zaro ta’sir: Auditoriya faol: har bir postga o‘rtacha 3 ta reaksiya keladi.
- Tematik yo‘nalishlar: Kontent placement, gaurntee, suree, capgemini, infosy kabi asosiy mavzularga jamlangan.
📝 Tavsif va kontent siyosati
Muallif resursni shaxsiy fikrni ifoda etish maydoni sifatida ta’riflaydi:
“🔥Guys plz Stop fearing for daily exams 📝
👨💻 @srksvk is here to help you all at lowest cost possible.💪
🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company
🔥Effort from our side = 💯
📱Main Channel: @coding_are
📱Tel I'd : @srks...”
Yuqori yangilanish chastotasi (oxirgi ma’lumot 30 Iyul, 2026 da olingan) sababli kanal doimo dolzarb va katta qamrovli bo‘lib qoladi. Analitika auditoriya kontent bilan faol hamkorlik qilishini, uni Taʼlim toifasidagi muhim ta’sir nuqtasiga aylantirishini ko‘rsatadi.
import java.util.*;
class Main {
public static int solve(int n,int k,int[] v,int[] w){
long sumA=0,sumB=0;
ArrayList<Integer> list=new ArrayList<>();
for(int i=0;i<n;i++){
if(v[i]==1)sumA+=w[i];
else sumB+=w[i];
list.add(w[i]);
}
if(sumA>sumB)return 0;
Collections.sort(list,Collections.reverseOrder());
int ops=0;
for(int x:list){
if(ops==k)break;
sumA+=x;
sumB-=x;
ops++;
if(sumA>sumB)return ops;
}
return -1;
}
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int k=sc.nextInt();
int[] v=new int[n];
for(int i=0;i<n;i++)v[i]=sc.nextInt();
int[] w=new int[n];
for(int i=0;i<n;i++)w[i]=sc.nextInt();
System.out.println(solve(n,k,v,w));
}
}