Hackerrank/icecream-parlor.cpp at master · shklqm/Hackerrank · 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
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

void icecream(vector<int> &real ,vector<int> &nr, int M)
{
	int N 		= nr.size();
	int start 	= 0;
	int end		= N-1;

	for(int i=0; i<N; i++)
	{
		int target = M - nr[start];

		if(nr[start] + nr[end] > M)
			end--;
		else if(nr[start] + nr[end] < M)
			start++;
		else if(nr[start] + nr[end] == M)
			break;
	}

	bool s=false, e=false;
	for(int i=0; i<N; i++)
	{
		if(!s && real[i] == nr[start])
		{
			start 	= i+1;
			s		= true;
		}
		else if(!e && real[i] == nr[end])
		{
			end = i+1;
			e	= true;
		}
	}

	if(start < end)
		cout<<start<<" "<<end<<endl;
	else
		cout<<end<<" "<<start<<endl;
}

int main() {

	int T;
	cin>>T;

	while(T)
	{
		int M,N;
		cin>>M>>N;

		vector<int> nr, real;

		for(int i=0; i<N; i++)
		{
			int temp;
			cin>>temp;
			nr.push_back(temp);
			real.push_back(temp);
		}

		sort(nr.begin(), nr.end());

		icecream(real, nr, M);

		T--;
	}

    return 0;
}