# HackerEarth Card game problem solution

In this HackerEarth Card game problem solution, Two friends decided to play a very exciting online card game. At the beginning of this game, each player gets a deck of cards, in which each card has some strength assigned. After that, each player picks random card from his deck and they compare strengths of picked cards. The player who picked card with larger strength wins. There is no winner in case both players picked cards with equal strength.

First friend got a deck with n cards. The i-th his card has strength ai. Second friend got a deck with m cards. The i-th his card has strength bi.

First friend wants to win very much. So he decided to improve his cards. He can increase by 1 the strength of any card for 1 dollar. Any card can be improved as many times as he wants. The second friend can't improve his cards because he doesn't know about this possibility.

What is the minimum amount of money which the first player needs to guarantee a victory for himself?

## HackerEarth Card game problem solution.

`#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <string>#include <vector>#include <algorithm>#include <set>#include <map>#include <cmath>#include <ctime>#include <functional>#include <sstream>#include <fstream>#include <valarray>#include <complex>#include <queue>#include <cassert>#include <bitset>using namespace std;#ifdef LOCAL#define debug_flag 1#else#define debug_flag 0#endif  template <class T1, class T2 >std::ostream& operator << (std::ostream& os, const pair<T1, T2> &p) {  os << "[" << p.first << ", " << p.second << "]";  return os;}  template <class T >std::ostream& operator << (std::ostream& os, const std::vector<T>& v) {  os << "[";  bool first = true;  for (typename std::vector<T>::const_iterator it = v.begin(); it != v.end(); ++it)  {    if (!first)      os << ", ";    first = false;    os << *it;  }  os << "]";  return os;}#define dbg(args...) { if (debug_flag) { _print(_split(#args, ',').begin(), args); cerr << endl; } else { void(0);} }vector<string> _split(const string& s, char c) {  vector<string> v;  stringstream ss(s);  string x;  while (getline(ss, x, c))    v.emplace_back(x);  return v;}void _print(vector<string>::iterator) {}template<typename T, typename... Args>void _print(vector<string>::iterator it, T a, Args... args) {  string name = it -> substr((*it)[0] == ' ', it -> length());  if (isalpha(name[0]))    cerr << name  << " = " << a << " ";  else    cerr << name << " ";  _print(++it, args...);}typedef long long int int64;vector<int> read() {  int n;  scanf("%d", &n);  vector<int> l(n);  for (int i = 0; i < n; i++) {    scanf("%d", &l[i]);  }  return l;}int main(){#ifdef LOCAL  freopen ("input.txt", "r", stdin);#endif  vector<int> l1 = read();  vector<int> l2 = read();  int mx = *max_element(l2.begin(), l2.end());  int64 ans = 0;  for (int x : l1) {    if (x <= mx) {      ans += mx + 1 - x;    }  }  printf("%lld\n", ans);  return 0;}`

### Second solution

`#include <fstream>#include <iostream>#include <string>#include <complex>#include <math.h>#include <set>#include <vector>#include <map>#include <queue>#include <stdio.h>#include <stack>#include <algorithm>#include <list>#include <ctime>#include <memory.h>#include <assert.h>#define y0 sdkfaslhagaklsldk#define y1 aasdfasdfasdf#define yn askfhwqriuperikldjk#define j1 assdgsdgasghsf#define tm sdfjahlfasfh#define lr asgasgash#define norm asdfasdgasdgsd#define have adsgagshdshfhds#define ends asdgahhfdsfshdshfd#define eps 1e-8#define M_PI 3.141592653589793#define bsize 512#define ldouble long doubleusing namespace std;#define bs 1000000007const int N = 200031;int n;vector<int> v;int m;long long ans;int mx;int main(){  ios_base::sync_with_stdio(0);  //cin.tie(0);  cin>>n;  for (int i=1;i<=n;i++){    int val;    cin>>val;    v.push_back(val);  }  cin>>m;  for (int i=1;i<=m;i++){    int val;    cin>>val;    mx=max(mx,val);  }  for (int i=0;i<v.size();i++){    if (v[i]<=mx)      ans+=mx-v[i]+1;  }  cout<<ans<<endl;  return 0;}`