added questions

Author: deveshsangwan

greedy_problems/perimeter_with_condition.cpp

@@ -0,0 +1,57 @@
+/*
+Aahad gives an array of integers and asks Harshit to find which three elements form a triangle (non-degenerate). The task seems easy to Harshit.
+So, Aahad adds some conditions to this task -
+1. Find the triangle with maximum perimeter
+2. If there are two or more combinations with same value of maximum perimeter, then find the one with the longest side.
+3.If there are more than one combinations which satisfy all the above conditions the find with maximum longest minimum side.
+Input Format
+The First line contains no of elements of array: N
+Each T lines contains N space-separated integers: A [i]
+Output Format
+The output contains three space-separated elements that denote the length of the sides of triangle. If no such triangle is possible, then print -1.
+Constraints
+1 =< N <= 10^5 
+1 <= A[i] <= 10^9
+Time Limit: 1 second
+Sample Input1:
+5
+1 1 1 3 3
+Sample Output1:
+1 3 3 
+Sample Input2:
+3
+2 2 4
+Sample Output3:
+-1 
+Explaination
+In the First Sample case, the elements that form a triangle with maximum perimeter is 1,3,3.
+In the Second Sample case, the elements that can form a triangle are degenerate, so, we printed -1.
+*/
+#include<bits/stdc++.h>
+using namespace std;
+int main() {
+    // Write your code here
+    int n;
+    cin>>n;
+    int arr[n];
+    for(int i=0;i<n;i++){
+        cin>>arr[i];
+    }
+    sort(arr,arr+n);
+    reverse(arr,arr+n);
+    bool flag = false;
+    int index = 0;
+    for(int i=0;i<n-2;i++){
+        if(arr[i+2]+arr[i+1]>arr[i]){
+            flag = true;
+            index = i;
+            break;
+        }
+    }
+    if(flag){
+        cout<<arr[index+2]<<" "<<arr[index+1]<<" "<<arr[index]<<endl;
+    }
+    else{
+        cout << -1;
+    }
+}

greedy_problems/weighted_job_scheduling.cpp

@@ -1,3 +1,26 @@
+/*
+You are given N jobs where every job is represented as:
+1.Start Time
+2.Finish Time
+3.Profit Associated
+Find the maximum profit subset of jobs such that no two jobs in the subset overlap.
+Input
+The first line of input contains one integer denoting N.
+Next N lines contains three space separated integers denoting the start time, finish time and the profit associated with the ith job. 
+Output
+Output one integer, the maximum profit that can be achieved.
+Constraints
+1 ≤ N ≤ 10^6
+1 ≤ ai, di, p ≤ 10^6
+Sample Input
+4
+3 10 20
+1 2 50
+6 19 100
+2 100 200
+Sample Output
+250
+*/
 #include <iostream> 
 #include <algorithm> 
 using namespace std;