-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathSNAKEEAT.txt
65 lines (51 loc) · 1.22 KB
/
SNAKEEAT.txt
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
#include<iostream>
using namespace std;
int main()
{ int t,n,q,i,j,a[100000],b[100000],flag=0,k,c;
cin>>t;
while(t>0)
{
cin>>n>>q;
for(i=0;i<n;i++)
{ cin>>a[i];
}
for(j=0;j<q;j++)
{
cin>>b[j];
}
for(j=0;j<q;j++)
{
for(i=0;i<n;i++)
{
if(b[j]<=a[i])
{
continue;
}
else
{
for(k=0;k<n;k++)
{
if(a[i]>a[k] && a[k]!=0 && a[i]!=0 && a[i]<b[j])
{
c=a[i];
a[k]=0;
a[i]=c+1;
}
else
{continue;}
}
}
}
for(i=0;i<n;i++)
flag=0;
for(i=0;i<n;i++)
{
if(a[i]>=b[j])
{ flag++;}
}
printf("%d\n",flag);
}
t--;
}
return 0;
}