-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem3_057.cpp
More file actions
115 lines (97 loc) · 2.24 KB
/
Copy pathproblem3_057.cpp
File metadata and controls
115 lines (97 loc) · 2.24 KB
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
<<<<<<< HEAD
#include <iostream>
using namespace std;
struct Activity
{
int startTime;
int finish;
int index;
};
void printMaxActivities(Activity arr[], int size)
{
for (int i = 0; i < size; i++)
{
for (int j = i + 1; j < size; j++)
{
if (arr[i].finish > arr[j].finish)
{
swap(arr[i], arr[j]);
}
}
}
int i = 0;
cout << "(" << arr[i].startTime << "," << arr[i].finish << ") ";
for (int j = 1; j < size; j++)
{
if (arr[j].startTime >= arr[i].finish)
{
cout << "(" << arr[j].startTime << "," << arr[j].finish << ") ";
i = j;
}
}
}
int main()
{
int startTime[] = {5, 1, 3, 0, 5, 8};
int finish[] = {9, 2, 4, 6, 7, 9};
const int size = sizeof(startTime) / sizeof(startTime[0]);
Activity arr[size];
for (int i = 0; i < size; i++)
{
arr[i].startTime = startTime[i];
arr[i].finish = finish[i];
arr[i].index = i + 1;
}
cout << "Output: ";
printMaxActivities(arr, size);
return 0;
}
=======
#include <iostream>
using namespace std;
struct Activity
{
int startTime;
int finish;
int index;
};
void printMaxActivities(Activity arr[], int size)
{
for (int i = 0; i < size; i++)
{
for (int j = i + 1; j < size; j++)
{
if (arr[i].finish > arr[j].finish)
{
swap(arr[i], arr[j]);
}
}
}
int i = 0;
cout << "(" << arr[i].startTime << "," << arr[i].finish << ") ";
for (int j = 1; j < size; j++)
{
if (arr[j].startTime >= arr[i].finish)
{
cout << "(" << arr[j].startTime << "," << arr[j].finish << ") ";
i = j;
}
}
}
int main()
{
int startTime[] = {5, 1, 3, 0, 5, 8};
int finish[] = {9, 2, 4, 6, 7, 9};
const int size = sizeof(startTime) / sizeof(startTime[0]);
Activity arr[size];
for (int i = 0; i < size; i++)
{
arr[i].startTime = startTime[i];
arr[i].finish = finish[i];
arr[i].index = i + 1;
}
cout << "Output: ";
printMaxActivities(arr, size);
return 0;
}
>>>>>>> 59f02f6c7ef4248ba7d85964ef2a53455d58ad43