2 051
订阅者
无数据24 小时
无数据7 天
无数据30 天
帖子存档
Lohith [
821298134] is sending a spam message.
• Warns now: (3/3) ❕
• Action: Muted 🔇Hi h Join Our Channel for daily Off-Campus Job Updates ❤️
👇👇
@offcampusjobs_0
@offcampusjobs_0
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;
}
