DesignPatterns/interview_scheduling.cpp at master · CodeWithKartik/DesignPatterns · 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
#include <iostream>
#include <algorithm>
#include <vector>

class Data
{
    public:
    int sums;
    int indices;
    bool operator()(const Data &a, const Data &b)
    {
        if (a.sums < b.sums) return false;
        else return true;
    }
};

int main()
{
	int N;
	std::cin>>N;
	//Data structures
	int Info[N][3];
	std::vector<Data> Sum;
	//Input
	for (int i = 0; i < N; ++i)
	{
		std::cin>>Info[i][0];
		std::cin>>Info[i][1];
		std::cin>>Info[i][2];
		Data d;
		d.sums = Info[i][0];
		d.sums += Info[i][1];
		d.sums += Info[i][2];
		d.indices = i;
		Sum.push_back(d);
	}
	//sorting
	std::sort(Sum.begin(), Sum.end(), Data());
	//modify sorted order
	for (int i = 0; i < N; ++i)
	{
		//fix at i
		int ind = i;
		while (ind > 0 && (Sum[ind].sums == Sum[ind - 1].sums))
		{
			if (Info[Sum[ind].indices][0] < Info[Sum[ind-1].indices][0])
				std::swap<Data>(Sum[ind], Sum[ind-1]);
			ind--;
		}
	}
	//find the max
	int mx = 0;
	int sm = 0;
	for (int i = 0; i < N; ++i)
	{
		int ind = Sum[i].indices;
		int val = Info[ind][0] + Info[ind][1] + Info[ind][2] + sm;
		sm += Info[ind][0];
		if (mx < val) mx = val;
	}

	std::cout<<mx<<std::endl;

	return 0;
}