-
Notifications
You must be signed in to change notification settings - Fork 2
/
CHEFINSQ.java
76 lines (76 loc) · 1.07 KB
/
CHEFINSQ.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
import java.io.*;
import java.lang.*;
import java.math.*;
import java.util.*;
class CHEFINSQ
{
public static void main(String[]args)
{
Scanner venki=new Scanner(System.in);
int t=venki.nextInt();
for(int T=0;T<t;T++)
{
int i,j,count,n,k;
n=venki.nextInt();
k=venki.nextInt();
int a[]=new int[n];
for(i=0;i<n;i++)
a[i]=venki.nextInt();
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
int temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
int flag=0,min=0,c=0,x=0,max=0,f[]=new int[k];
for(i=0;i<k;i++)
{
if(a[i]!=a[i+1] && i!=(k-1))
flag=1;
min+=a[i];
}
if(flag==0)
{
for(i=0;i<k;i++)
{
for(j=0;j<n;j++)
{
if(a[j]==a[i])
{
f[i]++;
}
}
if(f[i]>max)
{
max=f[i];
}
}
x=max;
}
else
{
for(i=0;i<n;i++)
{
count=0;
for(j=i;j<n;j++)
{
c+=a[j];
count++;
if(count==k)
break;
}
if(c==min)
x++;
c=0;
}
}
System.out.println(x);
}
}
}