competitiveCoding/snakeeat2.cpp at master · Arvind2222/competitiveCoding · GitHub

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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
#include <bits/stdc++.h>
using namespace std;

int main(int argc, char const *argv[])
{
	int t;
	scanf("%d",&t);
	int ele;
	int k;
	int n,q;
	std::vector<int> v;
	int result;

	for (int i = 0; i < t; ++i)
	{
		scanf("%d %d",&n,&q);

		for (int j = 0; j < n; ++j)
		{
			scanf("%d",&ele);

			v.push_back(ele);


		}
		sort(v.rbegin(), v.rend());


		for (int j = 0; j < q; ++j)
		{
			scanf("%d",&k);


						int remain;
						int pos;
						int result = 0;
			if(k>v[0]+n-1)
				{

					result = 0;
				}
			else if(v[n-1]>=k)
				{

					result = n;

				}
			else {


					int temp3 = n-1;


							while(v[temp3]<k && temp3>=0)
							{
								temp3--;
							}


					if(temp3 == -1)
						{

							pos = 0;
							remain = n;
							result = 0;
								while(k - v[pos+1] <= remain-1 && pos <= n-1 && remain > 0)
								{
									if(k-v[pos+1] <= remain-1)
									{
										pos++;
										remain -= (k-v[pos]);
											result++;

									}
								}

						}
					else
					{

						pos = temp3;

						remain = n - pos -1;

						result = pos + 1;

						while(k - v[pos+1] <= remain-1 && pos <= n-1 && remain > 0)
						{
							if(k-v[pos+1] <= remain-1)
							{
								pos++;
								remain -= (k-v[pos]);

								result++;


							}
						}

					}


				}

		printf("%d\n",result);
	}

		v.clear();
	}


	return 0;
}