ch
Feedback

不要被骗子欺骗!Telemetrio 会找到并标记这些频道 👉 如果想查看标记,请订阅

Coding Solutions Group

Coding Solutions Group

前往频道在 Telegram

显示更多
印度未指定类别
2 051
订阅者
无数据24 小时
无数据7 天
无数据30 天
帖子存档
Lohith [821298134] is sending a spam message. • Warns now: (3/3) ❕ • Action: Muted 🔇

Make any basic project

Nooo

Photo from gayatri

Goat, world renowned, array of A to N elements Plzzzzz

Hi h Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @offcampusjobs_0 @offcampusjobs_0

anyone can send today's question with answers.. pdd

Fast

Ans broo

Ans plz

Submit it

int solution(int n,int k,int[][] inp) { int i=0; int result=0; while(i+k-1 ts=new TreeSet(); int ct=k; int ind=i; int sec_sum=Integer.MAX_VALUE; while(ct-->0) { ts.add(inp[ind][0]); sec_sum=Math.min(sec_sum,inp[ind][1]); ind++; } int first_sum=0; int trav1=0,trav2=k-1; while(trav1<=trav2) { if(trav1==trav2) { first_sum=first_sum+ts.first(); break; } first_sum=first_sum+ts.last(); first_sum=first_sum-ts.first(); trav1++;trav2--; ts.pollFirst();ts.pollLast(); } result=Math.max(result,first_sum*sec_sum); i++; } return result; }