1000A - Codehorses T-shirts - CodeForces Solution


greedy implementation *1200

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;

bool compare(string a, string b) {
  if (a.size() == b.size()) {
    return a < b;
  }
  return a.size() < b.size();
}

int main() {
  int n;
  cin >> n;
  vector<string> prv(n);
  for (int i = 0; i < n; i++) {
    cin >> prv[i];
  }
  vector<string> cur(n);
  for (int i = 0; i < n; i++) {
    cin >> cur[i];
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (prv[i] == cur[j]) {
        prv[i] = "";
        cur[j] = "";
        break;
      }
    }
  }
  sort(prv.begin(), prv.end(), compare);
  sort(cur.begin(), cur.end(), compare);
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (prv[i] != cur[i]) {
      ans++;
    }
  }
  cout << ans << "\n";
  return 0;
}


Comments

Submit
0 Comments
More Questions

1654C - Alice and the Cake
369A - Valera and Plates
1626A - Equidistant Letters
977D - Divide by three multiply by two
1654B - Prefix Removals
1654A - Maximum Cake Tastiness
1649A - Game
139A - Petr and Book
1612A - Distance
520A - Pangram
124A - The number of positions
1041A - Heist
901A - Hashing Trees
1283A - Minutes Before the New Year
1654D - Potion Brewing Class
1107B - Digital root
25A - IQ test
785A - Anton and Polyhedrons
1542B - Plus and Multiply
306A - Candies
1651C - Fault-tolerant Network
870A - Search for Pretty Integers
1174A - Ehab Fails to Be Thanos
1169A - Circle Metro
780C - Andryusha and Colored Balloons
1153A - Serval and Bus
1487C - Minimum Ties
1136A - Nastya Is Reading a Book
1353B - Two Arrays And Swaps
1490E - Accidental Victory