Skip to content
Programmingoneonone
Programmingoneonone
  • Home
  • CS Subjects
    • Internet of Things (IoT)
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
  • Work with US
Programmingoneonone
Programmingoneonone

HackerEarth Pro and Con List problem solution

YASH PAL, 31 July 2024
In this HackerEarth Pro and Con List problem solution, There is a long list of n girls in front of Barney, and he is to calculate the optimal “happiness” he can find by selecting exactly 2 girls. (Why 2? No one knows!)
Ted, as a fan of pros and cons, suggests to make a list, a method for estimating the maximum happiness that Barney can achieve.
Each girl is characterized by two parameters:
– favour: if this girl is chosen, his happiness increases by this amount.
– anger: if this girl is not chosen, his happiness decreases by this amount.
Find the maximum “happiness” that Barney can obtain. Note that the answer is allowed to be negative.
HackerEarth Pro and Con List problem solution

HackerEarth Pro and Con List problem solution.

#include <bits/stdc++.h>

using namespace std;

int main ()
{
int tc;

vector < int > favor;
vector < int > anger;
vector < long long int > ans;

scanf("%d",&tc);

assert(1<=tc);
assert(tc<=10);

while (tc--)
{
int n;

favor.clear();
anger.clear();
ans.clear();

scanf("%d",&n);
assert(2<=n);
assert(n<=100000);

favor.resize(n);
anger.resize(n);
ans.resize(n);

long long int hatao = 0;

for (int i=0; i<n; i++)
{
scanf("%d %d",&favor[i], &anger[i]);

ans[i] = favor[i] + anger[i];
hatao = hatao + anger[i];

assert(0<=favor[i]);
assert(favor[i]<=1000000000);
assert(0<=anger[i]);
assert(anger[i]<=1000000000);
}

sort(ans.rbegin(),ans.rend());

cout << ans[0] + ans[1] - hatao << endl;
}
return 0;
}
coding problems solutions

Post navigation

Previous post
Next post

Related website

The Computer Science

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2025 Programmingoneonone | WordPress Theme by SuperbThemes