Activity Selection Problem - Hackerrank Problem Solution

Activity Selection Problem

Hackerrank Problem Solution

Activity Selection Problem - Hackerrank Problem Solution

PROBLEM STATEMENT
You are given a set of Activities with their start and finish time. Prints a maximum set of activities that can be done by a single person, one at a time. n : total number of activities id[]: IDs of activities s[] : an array that contains start time of all activities f[] : an array that contains finish time of all activities

Input Format

First line contains total number of activities, n. Second line contains n space separated integers denoting IDs of activities. Third line contains n space separated integers denoting start time of the activities. Forth line contains n space separated integers denoting finish time of the activities.

Constraints

5≤n≤50, where n is the number of activities.

Output Format

Print the space separated IDs of activities which can be performed in a single line

Sample Input 0

6
1 2 3 4 5 6
1 3 0 5 8 5 
2 4 6 7 9 9 

Sample Output 0

1 2 4 5

---

SOLUTION IN C

#include <stdio.h> #include <string.h> #include <math.h> #include <stdlib.h> struct Activity{ int id; int start; int finish; }; int main() { /* Enter your code here. Read input from STDIN. Print output to STDOUT */ int n; scanf("%d",&n); struct Activity activities[n]; int id[n],start[n],finish[n]; for(int i=0;i<n;i++){ scanf("%d",&id[i]); } for(int i=0;i<n;i++){ scanf("%d",&start[i]); } for(int i=0;i<n;i++){ scanf("%d",&finish[i]); } for(int i=0;i<n;i++){ activities[i].id=id[i]; activities[i].start=start[i]; activities[i].finish=finish[i]; } for(int i=1;i<n;i++){ for(int j=0;j<n-1;j++){ if(activities[j].finish>activities[j+1].finish){ struct Activity temp=activities[j]; activities[j]=activities[j+1]; activities[j+1]=temp; } } } printf("%d ",activities[0].id); int i=0; for(int j=1;j<n;j++){ if(activities[j].start>=activities[i].finish){ printf("%d ",activities[j].id); i=j; } } return 0; }

Share Share Tweet Share Share Share

LIKE?

SHARE If you find this useful, please share with your friends and Community.
CODE TOGETHER..GROW TOGETHER.