TITLE:-Maximum Profit on App
PROBLEM:-
You have made a smartphone app and want to set its price such that the profit earned is maximised. There are certain buyers who will buy your app only if their budget is greater than or equal to your price.
You will be provided with a list of size N having budgets of buyers and you need to return the maximum profit that you can earn.
Lets say you decide that price of your app is Rs. x and there are N number of buyers. So maximum profit you can earn is :
m * x
where m is total number of buyers whose budget is greater than or equal to x.
Line 1 : N (No. of buyers)
Line 2 : Budget of buyers (separated by space)
Maximum profit
Constraints :
1 <= N <= 10^6
4
30 20 53 14
Sample Output 1 :
60
Sample Output 1 Explanation :
Price of your app should be Rs. 20 or Rs. 30. For both prices, you can get the profit Rs. 60.
5
34 78 90 15 67
Sample Output 2 :
201
Sample Output 2 Explanation :
Price of your app should be Rs. 67. You can get the profit Rs. 201 (i.e. 3 * 67).
SOLUTION:-
#include <iostream>
using namespace std;
#include<bits/stdc++.h>
int maximumProfit(int budget[], int n) {
// Write your code here
sort(budget,budget+n);
int *output;
output=new int[n];
int j=n;
for(int i=0;i<n;i++)
{
output[i]=budget[i]*j;
j--;
}
int max=output[0];
for(int k=1;k<n;k++)
{
if(max<output[k])
max=output[k];
}
return max;
}
int main() {
int n ,*input,i,*cost;
cin>>n;
input = new int[n];
for(i = 0;i < n;i++)
cin>>input[i];
cout << maximumProfit(input, n) << endl;
}
