submission_id
stringlengths 5
9
| problem_id
stringlengths 3
6
| date
int64 -1
-1
| language
stringclasses 11
values | verdict
stringclasses 1
value | cpu_time
int64 -1
15k
| memory
int64 -1
1.07B
| code
stringlengths 16
11k
| source
stringclasses 1
value | testcount
int64 0
604
| lenght
int64 16
11k
|
|---|---|---|---|---|---|---|---|---|---|---|
56880476 | 1000A | -1 | cpp | Accepted | 30 | 8,192 | #include<bits/stdc++.h>
using namespace std;
map <string,int> p;
int main() {
int n;
ios_base::sync_with_stdio(false);
cin.tie(0);cin>>n;
int ans=n;
for(int i=0;i<n;i++) {
string temp;
cin>>temp;
p[temp]++;
}
for(int i=0;i<n;i++) {
string temp;
cin>>temp;
if(p[temp]) {
ans--;
p[temp]--;
}
}
cout<<ans<<endl;
}
| codeforces | 37 | 428 |
39820120 | 1000A | -1 | cpp | Accepted | 31 | 192,512 | #include<iostream>
using namespace std;
struct bb
{
char c[300];
};
int main()
{
int t,i=0;
struct bb a[300];
struct bb x[300];
while(cin>>t)
{
int m=t;
int sum=t;
int j=i;
while(t--)
cin>>a[i++].c;
while(m--)
cin>>x[j++].c;
for(int p=0;p<i;p++)
for(int y=0;y<i;y++)
{
if(strcmp(a[p].c,x[y].c)==0)
{
x[y].c[0]='a';
sum--;
break;
}
}
cout<<sum<<endl;
}
return 0;
} | codeforces | 37 | 429 |
41233180 | 1000A | -1 | cpp | Accepted | 31 | 16,384 | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
const int len=100000;
map<string,int>mp1,mp2;
int main(){
string str,s[105];
int n,sum=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>s[i];
mp1[s[i]]++;
}
for(int i=0;i<n;i++){
cin>>str;
if(mp1[str])
{
mp1[str]--;
}
else
{
sum++;
}
}
cout<<sum<<endl;
} | codeforces | 37 | 429 |
39704891 | 1000A | -1 | cpp | Accepted | 30 | 151,552 | /* In the name of Allah */
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base :: sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
int n, ans = 0;
cin >> n;
multiset<string> s;
for (int i = 0; i < n; i++) {
string x;
cin >> x;
s.insert(x);
}
for (int i = 0; i < n; i++) {
string x;
cin >> x;
if (s.count(x))
s.erase(s.find(x));
else
ans++;
}
cout << ans << endl;
return 0;
}
| codeforces | 37 | 430 |
39723572 | 1000A | -1 | cpp | Accepted | 30 | 8,192 | #include <bits/stdc++.h>
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
typedef long long int ll;
int main(void){
fast;
int n; cin >> n;
string a[n], b[n];
map<string, int> m;
for (int i = 0; i < n; ++i){
cin >> a[i];
++m[a[i]];
}
for (int i = 0; i < n; ++i){
cin >> b[i];
--m[b[i]];
}
int ans = 0;
for (auto it : m){
ans += abs(it.second);
}
ans >>= 1;
cout << ans;
} | codeforces | 37 | 430 |
40220977 | 1000A | -1 | cpp | Accepted | 31 | 12,288 | #include<iostream>
#include<unordered_map>
#include<vector>
#include<string>
using namespace std;
int main(){
int n, ans=0;
cin>>n;
vector<string> vec(2*n);
for(int i=0; i<2*n; i++){
cin>>vec[i];
}
unordered_map<string, int> m;
for(int i=0; i<n; i++){
m[vec[i]]++;
}
for(int i=n; i<2*n; i++){
if(m[vec[i]]){
m[vec[i]]--;
} else{
ans++;
}
}
cout << ans<< endl;
}
| codeforces | 37 | 430 |
57832520 | 1000A | -1 | cpp | Accepted | 31 | 8,192 | #include<bits/stdc++.h>
using namespace std;
map<string,int> mp1,mp2;
int main()
{
mp1.clear();
mp2.clear();
int n,ans=0;
string s[105];
string str;
cin>>n;
for(int i=0;i<n;i++) {cin>>s[i];mp1[s[i]]++;}
for(int i=0;i<n;i++) {cin>>str;if(!mp1[str]) ans++;else mp2[str]++;}
for(int i=0;i<n;i++) if(mp2[s[i]]-mp1[s[i]]>0) ans+=mp2[s[i]]-mp1[s[i]],mp2[s[i]]=-1;
cout<<ans<<endl;
return 0;
} | codeforces | 37 | 430 |
110947655 | 1000A | -1 | cpp | Accepted | 31 | 147,456 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll n;
cin>>n;
unordered_map<string,int>a;
unordered_map<string,int>b;
string s;
for(int i=0;i<n;i++){
cin>>s;
a[s]++;
}
for(int i=0;i<n;i++){
cin>>s;
b[s]++;
}
int ans=0;
for(auto i:a){
ans+=min(i.second,b[i.first]);
}
cout<<n-ans;
}
| codeforces | 37 | 430 |
39711435 | 1000A | -1 | cpp | Accepted | 31 | 24,576 | #include <iostream>
using namespace std;
int n;
string a[100], b[100];
bool check[100];
main(){
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
int cnt = 0;
for (int i = 0; i < n; i++){
cin >> b[i];
for (int j = 0; j < n; j++)
if (a[j] == b[i] && !check[j]){
check[j] = true;
cnt++;
break;
}
}
cout << n - cnt;
}
| codeforces | 37 | 431 |
39835070 | 1000A | -1 | cpp | Accepted | 31 | 12,288 | #include <iostream>
#include <map>
#include <utility>
using namespace std;
int main()
{
int t,n,k=0;
cin>>t;
n=t;
string s;
map<string,int>m;
map<string,int> ::iterator it;
while(t--)
{
cin>>s;
m[s]++;
}
while(n--)
{
cin>>s;
m[s]--;
}
for(it=m.begin();it!=m.end();it++)
{
if(it->second > 0)
k+=it->second;
}
cout<<k;
} | codeforces | 37 | 431 |
47247712 | 1000A | -1 | cpp | Accepted | 30 | 4,096 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n;
int main() {
cin>>n;
vector<string> a(n),b(n);
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
cin>>b[i];
sort(a.begin(),a.end());
int ans =0;
for(int i=0;i<n;i++){
if(find(a.begin(),a.end(),b[i])!=a.end())
a.erase(find(a.begin(),a.end(),b[i]));
else ans++;
}
cout<<ans;
}
| codeforces | 37 | 431 |
71836901 | 1000A | -1 | cpp | Accepted | 30 | 8,192 | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<set>
#include<map>
using namespace std;
int n;
string cur;
map<string,int> mp,MP;
int main()
{
scanf("%d",&n);
int ans = 0;
for(int i = 1;i <= n; i++){
cin >> cur;
mp[cur]++;
}
for(int i = 1;i <= n; i++){
cin >> cur;
if(mp[cur] == 0) ans++;
else mp[cur]--;
}
printf("%d\n",ans);
}
| codeforces | 37 | 431 |
71836901 | 1000A | -1 | cpp | Accepted | 30 | 8,192 | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<set>
#include<map>
using namespace std;
int n;
string cur;
map<string,int> mp,MP;
int main()
{
scanf("%d",&n);
int ans = 0;
for(int i = 1;i <= n; i++){
cin >> cur;
mp[cur]++;
}
for(int i = 1;i <= n; i++){
cin >> cur;
if(mp[cur] == 0) ans++;
else mp[cur]--;
}
printf("%d\n",ans);
}
| codeforces | 37 | 431 |
89314833 | 1000A | -1 | cpp | Accepted | 31 | 3,731,456 | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
int main() {
// your code goes here
int n,ct=0;
string s;
cin>>n;
map<string,int> mp;
for(int i=0;i<n;i++)
{
cin>>s;
mp[s]++;
}
for(int i=0;i<n;i++)
{
cin>>s;
if(mp[s])
mp[s]--;
else
ct++;
}
cout<<ct;
return 0;
} | codeforces | 37 | 431 |
39706298 | 1000A | -1 | cpp | Accepted | 15 | 57,344 | #include <iostream>
#include <cmath>
#include <cstdio>
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
using namespace std;
string s[1000],st[1000];
int i,n,m,k,l;
int main() {
cin>>n;
for(i=1 ; i<=n ;i++){
cin>>s[i];
}
for(i=1 ; i<=n ;i++){
cin>>st[i];
for(l=1 ; l<=n ;l++){
if(s[l]==st[i] && s[l]!="-1"){
s[l]="-1";
st[i]="-1";
k++;
}
}
}
cout<<n-k;
return 0;
}
| codeforces | 37 | 432 |
39718714 | 1000A | -1 | cpp | Accepted | 15 | 12,288 | #include <cstdio>
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main(){
int n;
cin >> n;
vector<string> A(n), B(n);
for(int i = 0; i < n; ++i) cin >> A[i];
for(int i = 0; i < n; ++i) cin >> B[i];
map<string, int> M;
for(int i = 0; i < n; ++i) ++M[B[i]];
int ans = 0;
for(int i = 0; i < n; ++i){
if((!M[A[i]])) ++ans;
else --M[A[i]];
}
cout << ans << endl;
return 0;
}
| codeforces | 37 | 433 |
39723016 | 1000A | -1 | cpp | Accepted | 31 | 151,552 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef map<string,ll> M;
int main()
{
ll n;
cin>>n;
string a[n];
string b[n];
M pam;
M pam2;
for(ll i=0;i<n;i++)
{
cin>>a[i];
pam[a[i]]++;
}
for(ll i=0;i<n;i++)
{
cin>>b[i];
pam2[b[i]]++;
}
M::iterator p;
ll sm=0;
for(p=pam.begin();p!=pam.end();++p)
{
sm+=min((*p).second,pam2[(*p).first]);
}
cout<<n-sm;
}
| codeforces | 37 | 433 |
42463659 | 1000A | -1 | cpp | Accepted | 31 | 159,744 | #include<bits/stdc++.h>
using namespace std;
multiset<string> a,b;
int main()
{
int n;
string x;
cin>>n;
int ans=0;
for(int i=1; i<=n; i++)
{
cin>>x;
a.insert(x);
}
for(int i=1; i<=n; i++)
{
cin>>x;
b.insert(x);
}
for(auto i:a)
{
if (b.count(i)) b.erase(b.find(i));
else ans++;
}
cout<<ans<<endl;
} | codeforces | 37 | 433 |
42463659 | 1000A | -1 | cpp | Accepted | 31 | 159,744 | #include<bits/stdc++.h>
using namespace std;
multiset<string> a,b;
int main()
{
int n;
string x;
cin>>n;
int ans=0;
for(int i=1; i<=n; i++)
{
cin>>x;
a.insert(x);
}
for(int i=1; i<=n; i++)
{
cin>>x;
b.insert(x);
}
for(auto i:a)
{
if (b.count(i)) b.erase(b.find(i));
else ans++;
}
cout<<ans<<endl;
} | codeforces | 37 | 433 |
93000054 | 1000A | -1 | cpp | Accepted | 31 | 8,192 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin>>n;
bool a[2*n]={false};
vector<string>v;
string x;
ll sum=0,d;
for(ll i=0;i<2*n;i++)
{cin>>x;
v.push_back(x);
}
for(ll i=n;i<2*n;i++)
{d=0;
for(ll j=0;j<n;j++)
{if(v[i]==v[j]&&a[j]==false)
{a[j]=true;
d=1;
break;
}
}
if(d==0)
sum++;
}
cout<<sum;
} | codeforces | 37 | 433 |
109458520 | 1000A | -1 | cpp | Accepted | 31 | 12,288 | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n,count=0;
cin>>n;
vector<string> v1(n);
vector<string>v2(n);
vector<string> :: iterator pq;
for(long long i=0;i<n;i++) cin>>v1[i];
for(long long i=0;i<n;i++) cin>>v2[i];
for(long long i=0;i<n;i++){
pq=find(v2.begin(),v2.end(),v1[i]);
if(pq==v2.end()) count++;
else v2[pq-v2.begin()]="000";
};
cout<<count;
return 0;
} | codeforces | 37 | 433 |
39705857 | 1000A | -1 | cpp | Accepted | 31 | 12,288 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
string a[100],b[100];
int c[100],k,count=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
c[i]=1;
}
for(int j=0;j<n;j++)
{
k=0;
cin>>b[j];
for(int ko=0;ko<n;ko++)
{
if(b[j]==a[ko])
if(c[ko]==1)
{
k=1;
c[ko]=0;
break;
}
}
if(k!=1)
{
count++;
}
}
cout<<count;
return 0;
}
| codeforces | 37 | 434 |
39723844 | 1000A | -1 | cpp | Accepted | 30 | 147,456 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;cin>>n;
map<string,int>m1;
map<string,int>m2;
int i;
string x;
for(i=0;i<n;i++)
{
cin>>x;
m1[x]++;
}
for(i=0;i<n;i++)
{
cin>>x;
m2[x]++;
}
int s=0;
for(auto it=m2.begin();it!=m2.end();it++)
{
if(m1.find(it->first)==m1.end())
{
s+=it->second;
}
else
{
if(m2[it->first]>m1[it->first])
s+=m2[it->first]-m1[it->first];
}
}
cout<<s;
}
| codeforces | 37 | 434 |
39725279 | 1000A | -1 | cpp | Accepted | 30 | 24,576 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
map<string,int> mp;
for(int i=0;i<n;i++)
{
string str;
cin>>str;
mp[str]++;
}
int count1=0;
for(int j=0;j<n;j++)
{
string str;
cin>>str;
if(mp.find(str)!=mp.end())
{
if(mp[str]>0)
mp[str]--;
else
count1++;
}
else
count1++;
}
cout<<count1<<endl;
}
| codeforces | 37 | 434 |
39744548 | 1000A | -1 | cpp | Accepted | 31 | 147,456 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin>>n;
map<string,int>a,b;
for(int i=0;i<n;i++)
{
string x;
cin>>x;
a[x]++;
}
for(int i=0;i<n;i++)
{
string x;
cin>>x;
b[x]++;
}
int seconds=0;
for(auto u:b)
{
if(u.second>=a[u.first])
seconds+=u.second-a[u.first];
}
cout<<seconds<<endl;
return 0;
}
| codeforces | 37 | 434 |
44099225 | 1000A | -1 | cpp | Accepted | 31 | 12,288 | #include<bits/stdc++.h>
using namespace std;
set<string>q;
map<string ,int>s1,s2;
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
string temp;
cin>>temp;
q.insert(temp);
s1[temp]++;
}
for(int i=0;i<n;i++){
string temp;
cin>>temp;
s2[temp]++;
}
int ans=0;
set<string>::iterator it=q.begin();
for(;it!=q.end();it++){
ans+=max(0,s1[*it]-s2[*it]);
}
cout<<ans<<endl;
return 0;
}
| codeforces | 37 | 434 |
47188777 | 1000A | -1 | cpp | Accepted | 31 | 212,992 | #include<cstdio>
#include<algorithm>
#include<iostream>
#include<map>
#include<cstring>
using namespace std;
char a[1001][101];
char b[1001][101];
int main()
{
int i,j;
int n,sum;
map<string,int>q;
while(~scanf("%d",&n))
{
sum=0;
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
q[a[i]]++;
}
for(j=0;j<n;j++)
{
scanf("%s",b[i]);
if(q[b[i]]!=0)
q[b[i]]--;
else
sum++;
}
printf("%d\n",sum);
}
return 0;
} | codeforces | 37 | 434 |
77925432 | 1000A | -1 | cpp | Accepted | 31 | 16,384 | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
vector<string> s,s1;
int n;
cin>>n;
string p;
for(int i=0; i<n; i++)
{
cin>>p;
s.push_back(p);
}
for(int i=0; i<n; i++)
{
cin>>p;
for(int i=0; i<s.size(); i++)
{
if(p==s[i])
{
s.erase(s.begin()+i);
break;
}
}
}
cout<<s.size()<<endl;
return 0;
} | codeforces | 37 | 434 |
39722824 | 1000A | -1 | cpp | Accepted | 31 | 24,576 | #include<bits/stdc++.h>
using namespace std;
map<string,int>g;
string a[105],b[105];
int main()
{
int n;
ios::sync_with_stdio(false);
cin>>n;g.clear(); int ans=0;
for(int i=0;i<n;i++) {cin>>a[i];
g[a[i]]+=1;
}
for(int i=0;i<n;i++) {cin>>b[i];
if(g[b[i]]>0) g[b[i]]-=1;else ans++;}
cout<<ans<<endl;
return 0;
}
| codeforces | 37 | 435 |
39727759 | 1000A | -1 | cpp | Accepted | 31 | 24,576 | #include<bits/stdc++.h>
using namespace std;
long long i,j,k,n,flag,c;
int main()
{
string s1[200],s2[200];
cin>>n;
for(i=0;i<n;i++)
cin>>s1[i];
for(i=0;i<n;i++)
cin>>s2[i];
for(i=0;i<n;i++)
for(j=0;j<n;j++)
if(s2[i]==s1[j])
{
s1[j]="";
c++;
break;
}
cout<<n-c<<endl;
return 0;
}
| codeforces | 37 | 435 |
39754784 | 1000A | -1 | cpp | Accepted | 31 | 8,192 | #include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
cin >> n;
int x = n;
string old[100];
string New[100];
for (int i = 0; i<n; i++)
{
cin >> New[i];
}
for (int i = 0; i<n; i++)
{
cin >> old[i];
}
for (int i = 0; i<n ; i++)
{
for (int j = 0; j < n ; j++)
{
if (old[i] == New[j])
{
x--;
New[j] = "0";
break;
}
}
}
cout << x << endl;
} | codeforces | 37 | 435 |
39767018 | 1000A | -1 | cpp | Accepted | 31 | 151,552 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define PB push_back
int main(){
int n;
string t;
cin >> n;
multiset<string> m;
for(int i = 0; i < n; i++){
cin >> t;
m.insert(t);
}
for(int i = 0; i < n; i++){
cin >> t;
auto j = m.find(t);
if(j != m.end()) m.erase(j);
}
cout << m.size();
}
| codeforces | 37 | 435 |
39785679 | 1000A | -1 | cpp | Accepted | 31 | 12,288 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<string>v1,v2,lol;
string s;
for(int i=0;i<n*2;i++)
{
cin>>s;
if(i<n)v1.push_back(s);
else v2.push_back(s);
}
sort(v1.begin(),v1.end());
sort(v2.begin(),v2.end());
set_intersection(v1.begin(),v1.end(),v2.begin(),v2.end(),back_inserter(lol));
cout<<n-lol.size();
}
| codeforces | 37 | 435 |
39857054 | 1000A | -1 | cpp | Accepted | 31 | 4,096 | #include<bits/stdc++.h>
using namespace std;
map<string,int> mp;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int n,ans=0;
cin >> n;
for(int i=0;i<n;i++) {
string s;cin>>s;mp[s]++;
}
for(int i=0;i<n;i++) {
string s;cin>>s;mp[s]--;
}
for(auto it:mp){
if(it.second<0) ans+=-1*it.second;
}
cout << ans;
return 0;
} | codeforces | 37 | 435 |
74640579 | 1000A | -1 | cpp | Accepted | 31 | 8,192 | #include<iostream>
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main()
{
int n;
cin>>n;
string a[n],b[n];
for(int i=0; i<n; i++)
cin>>a[i];
for(int i=0; i<n; i++)
cin>>b[i];
int c=0;
for(int i=0; i<n; i++)
{
if(count(b,b+n,a[i])!=0)
{
for(int t=0; t<n; t++)
{
if(b[t]==a[i])
{
b[t]="NULL";
break;
}
}
c++;
}
}
cout<<(n-c)<<"\n";
}
| codeforces | 37 | 435 |
95327297 | 1000A | -1 | cpp | Accepted | 31 | 20,480 | #include <iostream>
#include <map>
using namespace std;
signed main()
{
int n;
map<string, int> maa, mab;
string str;
cin>>n;
for (int i = 0; i < n; i++)
{
cin >> str;
maa[str]++;
}
for(int i=0;i<n;i++)
{
cin>>str;
mab[str]++;
}
int ans=n;
for(auto it:mab){
ans-=min(maa[it.first],it.second);
}
cout<<ans<<endl;
} | codeforces | 37 | 435 |
39713007 | 1000A | -1 | cpp | Accepted | 31 | 12,288 | #include<bits/stdc++.h>
using namespace std;
string t[105];
string s[105];
bool r[105];
bool re[105];
int n,righ;
int main(){
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>s[i];
r[i]=1;
}
for(int i=1;i<=n;i++)
{
cin>>t[i];
for(int j=1;j<=n;j++)
if(s[j]==t[i]&&r[j]==1&&re[i]==0)
{
righ++;
r[j]=0;
re[i]=1;
}
}
int ans=n-righ;
cout<<ans<<endl;
return 0;
}
| codeforces | 37 | 436 |
39718955 | 1000A | -1 | cpp | Accepted | 31 | 12,288 | #include<bits/stdc++.h>
using namespace std;
int main (){
int t;
string ar[100], br[100];
cin>>t;
cin.ignore();
for(int i=0; i<t; i++){
cin>>ar[i];
}
for(int i=0; i<t; i++) cin>>br[i];
int cnt = 0;
for(int i=0; i<t; i++){
for(int j=0; j<t; j++){
if(br[i] == ar[j]) { cnt++; ar[j]="0"; break;}
}
}
cout<<t-cnt<<endl;
return 0;
}
| codeforces | 37 | 436 |
40657867 | 1000A | -1 | cpp | Accepted | 31 | 4,096 | #include<stdio.h>
#include<string.h>
int main()
{
int i,n,j,sum=0;
char aa[100][8],bb[100][8];
scanf("%d",&n);
sum=n;
getchar();
for(i=0;i<n;i++)
gets(aa[i]);
for(i=0;i<n;i++)
{
gets(bb[i]);
for(j=0;j<n;j++)
if(strcmp(aa[j],bb[i])==0)
{
sum--;
aa[j][0]='p';
break;
}
}
/* for(i=0;i<n;i++)
printf("%s \n",aa[i]);
for(i=0;i<n;i++)
printf("%s \n",bb[i]);*/
printf("%d",sum);
return 0;
} | codeforces | 37 | 436 |
48910547 | 1000A | -1 | cpp | Accepted | 31 | 8,192 | #include<bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
map<string, int> m;
for(int i=0;i<t;i++) {
string s;
cin>>s;
m[s]++;
}
int ans=0;
for(int i=0;i<t;i++) {
string s;
cin>>s;
m[s]--;
}
map<string, int>::iterator it = m.begin();
while(it!=m.end()) {
if(it->second < 0) {
ans+=it->second;
}
it++;
}
cout<<abs(ans)<<endl;
}
| codeforces | 37 | 436 |
48910547 | 1000A | -1 | cpp | Accepted | 31 | 8,192 | #include<bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
map<string, int> m;
for(int i=0;i<t;i++) {
string s;
cin>>s;
m[s]++;
}
int ans=0;
for(int i=0;i<t;i++) {
string s;
cin>>s;
m[s]--;
}
map<string, int>::iterator it = m.begin();
while(it!=m.end()) {
if(it->second < 0) {
ans+=it->second;
}
it++;
}
cout<<abs(ans)<<endl;
}
| codeforces | 37 | 436 |
49945664 | 1000A | -1 | cpp | Accepted | 30 | 155,648 | #include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define ld long double;
using namespace std;
signed main() {
int n;
cin >> n;
multiset<string> s1, s2;
for(int i = 0; i < n; i++) {
string q;
cin >> q;
s1.insert(q);
}
for(int i = 0; i < n; i++) {
string q;
cin >> q;
s2.insert(q);
}
for(auto x : s1) {
if(s2.find(x) != s2.end()) {
s2.erase(s2.find(x));
}
}
cout << s2.size();
}
| codeforces | 37 | 436 |
39704959 | 1000A | -1 | cpp | Accepted | 31 | 24,576 | #include <bits/stdc++.h>
using namespace std;
int n;
char st[100+1];
string s1[100+1], s2[100+1];
map<string, int> mp;
int main() {
scanf("%d", &n);
for(int i=0; i<n; ++i) {
scanf("%s", st);
s1[i] = st;
mp[s1[i]]++;
}
for(int i=0; i<n; ++i) {
scanf("%s", st);
s2[i] = st;
mp[s2[i]]--;
}
int res = 0;
for(auto x : mp)
if(x.second > 0)
res += x.second;
printf("%d\n", res);
return 0;
} | codeforces | 37 | 437 |
39706186 | 1000A | -1 | cpp | Accepted | 30 | 16,384 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
string s1[101];
string s2[101];
int main() {
ll n;
cin>>n;
for(int k=1;k<=n;k++){
cin>>s1[k];
}
for(int k=1;k<=n;k++){
cin>>s2[k];
}
ll ans=0;
ll ind=0;
for(int k=1;k<=n;k++){
ind=0;
for(int i=1;i<=n;i++){
if(s1[k]==s2[i]){
ind=1;
s2[i]="///";
break;
}
}
if(ind==0) ans++;
}
cout<<ans;
return 0;
}
| codeforces | 37 | 437 |
46960191 | 1000A | -1 | cpp | Accepted | 31 | 159,744 | #include <bits/stdc++.h>
using namespace std;
string sizes[]={"S","M","L","XS","XL","XXS","XXL","XXXS","XXXL"},s;
int n,ans;
map<string,int>cnta,cntb;
int main()
{
cin>>n;
for(int i=0;i<n;++i)
{
cin>>s;
++cnta[s];
}
for(int i=0;i<n;++i)
{
cin>>s;
++cntb[s];
}
for(int i=0;i<9;++i)
ans+=abs(cnta[sizes[i]]-cntb[sizes[i]]);
cout<<ans/2;
} | codeforces | 37 | 437 |
47852070 | 1000A | -1 | cpp | Accepted | 46 | 8,192 | #include <bits/stdc++.h>
using namespace std;
long n,res;
map <string,long> a;
string s ;
int main()
{
// freopen("in.inp","r",stdin);
// freopen("out.out","w",stdout);
cin >> n ;
for (long i=1;i<=n;i++)
{
cin >> s ;
a[s]++;
}
for (long i=1;i<=n;i++)
{
cin >> s ;
a[s]--;
if (a[s]<0)
res++;
}
cout << res;
return 0;
}
| codeforces | 37 | 437 |
70966034 | 1000A | -1 | cpp | Accepted | 31 | 155,648 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans=0;cin>>n;
map<string,int> m1,m2;
string str;
for(int i=1;i<=n;i++){
cin>>str;
m1[str]++;
}
for(int i=1;i<=n;i++){
cin>>str;
m2[str]++;
}
for(auto it:m2){
if(it.second > m1[it.first])
ans += it.second -m1[it.first];
}
cout<<ans<<endl;
return 0;
}
| codeforces | 37 | 437 |
99066437 | 1000A | -1 | cpp | Accepted | 31 | 4,096 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
string ab;
map<string,int> a;
cin>>n;
for(int i = 0;i < n; ++i){
cin>>ab;
if(!a.count(ab)) a[ab] = 1;
else a[ab]++;
}
int ans = 0;
for(int i = 0;i < n; ++i){
cin>>ab;
if(a.count(ab)&&a[ab] > 0) a[ab]--;
else ans++;
}
cout<<ans<<endl;
return 0;
}
| codeforces | 37 | 437 |
39717604 | 1000A | -1 | cpp | Accepted | 31 | 24,576 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int g;
cin >> g;string lala[g],lula[g];for(int i=0;i<g;i++)
{
cin >> lala[i];
}int hobbit=0;
for(int i=0;i<g;i++)cin >> lula[i];for(int i=0;i<g;i++)
{
for(int j=0;j<g;j++)
{
if(lala[i]==lula[j] and lala[i]!="0")
{hobbit++;lala[i]="0";lula[j]="0";}}}cout << g-hobbit;
return 0;
}
| codeforces | 37 | 438 |
39718567 | 1000A | -1 | cpp | Accepted | 31 | 90,112 | #include <bits/stdc++.h>
using namespace std;
int c[10001], d[10001];
int main () {
int n;
cin>>n;
string a[n+1],b[n+1];
for ( int i=1; i<=2*n; i++) {
if (i<=n) cin>>a[i];
else cin>>b[i-n];
}
int k=0;
for ( int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
if ((c[i]==0) && (d[j]==0))
if (a[i]==b[j]) {
k++;
c[i]=1;
d[j]=1;
}
cout<<n-k;
return 0;
} | codeforces | 37 | 438 |
77451956 | 1000A | -1 | cpp | Accepted | 46 | 45,056 | #include<bits/stdc++.h>
using namespace std;
map<string,int> test;
int main()
{
int n=0;
cin>>n;
string temp;
for(int i=1;i<=n;i++)
{
cin>>temp;
test[temp]++;
}
for(int i=1;i<=n;i++)
{
cin>>temp;
test[temp]--;
}
long long int ans=0;
for(map<string,int>::iterator i=test.begin();i!=test.end();i++)
{
if(i->second<0)
ans+=abs(i->second);
}
cout<<ans<<endl;
}
| codeforces | 37 | 438 |
39710491 | 1000A | -1 | cpp | Accepted | 31 | 155,648 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,i,count=0;
cin>>n;
vector<string>a(n);
vector<string>b(n);
string s;
for(i=0;i<n;i++)cin>>a[i];
for(i=0;i<n;i++)cin>>b[i];
map<string,int>ma,mb;
for(i=0;i<n;i++)ma[a[i]]++;
for(i=0;i<n;i++)mb[b[i]]++;
int ans=0;
for(auto it=mb.begin();it!=mb.end();it++){
s=it->first;
if(mb[s]-ma[s]>0)
ans+=mb[s]-ma[s];
}
cout<<ans<<endl;
return 0;
} | codeforces | 37 | 439 |
39750978 | 1000A | -1 | cpp | Accepted | 31 | 4,096 | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long a;
cin>>a;
map <string,long long> asd;
string d;
for(long long q=0;q<a;q++)
{
cin>>d;
asd[d]++;
}
for(long long q=0;q<a;q++)
{
cin>>d;
if(asd[d]>0)asd[d]--;
}
long long total=0;
string s[9]={"XXXS","XXS","XS","S","M","L","XL","XXL","XXXL"};
for(int q=0;q<9;q++)
{
total=total+asd[s[q]];
}
cout<<total<<endl;
}
| codeforces | 37 | 439 |
59561935 | 1000A | -1 | cpp | Accepted | 31 | 8,192 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <set>
#include <string>
const int N = 1e2 + 21;
std::multiset<std::string> a;
std::string s;
int n, ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) std::cin >> s, a.insert(s);
for (int i = 1; i <= n; i++) {
std::cin >> s;
if (a.count(s))
a.erase(a.find(s));
else
ans++;
}
printf("%d", ans);
} | codeforces | 37 | 439 |
71835902 | 1000A | -1 | cpp | Accepted | 31 | 12,288 | #include<cstdio>
#include<map>
#include<algorithm>
#include<string>
#include<iostream>
using namespace std;
const int maxn = 1e2 + 5;
map<string, int> mp;
int a[maxn],b[maxn];
int main(){
int n;
scanf("%d",&n);
string s;
for(int i = 1; i <= n; i++){
cin >> s;
mp[s]++;
}
int ans = 0;
for(int i = 1; i <= n; i++){
cin >> s;
if(mp[s]) mp[s]--;
else ans++;
}
printf("%d\n",ans);
return 0;
}
| codeforces | 37 | 439 |
39766637 | 1000A | -1 | cpp | Accepted | 30 | 151,552 | #include<bits/stdc++.h>
using namespace std;
int n,ans;
map<string,int>cnta;
map<string,int>cntb;
int main(){
cin>>n; ans=n;
vector<string>a(n);
vector<string>b(n);
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++) cin>>b[i];
for(int i=0;i<n;i++) cnta[a[i]]++,cntb[b[i]]++;
for(map<string,int>::iterator i=cnta.begin();i!=cnta.end();i++){
ans-=min(i->second,cntb[i->first]);
}
cout<<ans<<endl;
return 0;
}
| codeforces | 37 | 440 |
43087447 | 1000A | -1 | cpp | Accepted | 30 | 12,288 | #include <bits/stdc++.h>
using namespace std;
map<string,int> mp;
map<string,int> ms;
int main() {
int n; cin >> n;
vector<string> vs,va;
string s;
for(int i=0; i<n; i++) {
cin >> s; vs.push_back(s);
ms[s]++;
}
for(int i=0; i<n; i++) {
cin >> s; mp[s]++;
}
int c=0;
for(map<string,int>::iterator it=mp.begin(); it!=mp.end(); it++) {
if(mp[it->first]>ms[it->first] ) c+= mp[it->first]-ms[it->first];
}
cout << c << endl;
} | codeforces | 37 | 441 |
94420321 | 1000A | -1 | cpp | Accepted | 31 | 20,480 | #include <bits/stdc++.h>
using namespace std;
int n;
string a[110],b[110];
map <string,int> dem;
int main()
{
cin >> n;
for (int i=1;i<=n;i++)
{
cin >> a[i];
dem[a[i]]++;
}
for (int i=1;i<=n;i++)
{
cin >> b[i];
dem[b[i]]--;
}
int res=0;
for (int i=1;i<=n;i++)
{
res+=max(dem[a[i]],0);
dem[a[i]]=0;
}
cout << res;
}
| codeforces | 37 | 441 |
108364032 | 1000A | -1 | cpp | Accepted | 31 | 8,192 | #include<bits/stdc++.h>
#define endl '\n'
#define ll long long
using namespace std;
typedef pair<int,int> pii;
const int maxn = 1e6+10;
const int INF = 1e8;
const int mod = 1e9+7;
int main()
{
int n;
cin>>n;
map<string,int>mp;
for(int i=1;i<=n;i++) {
string s;
cin>>s;
mp[s]++;
}
int ans = 0;
for(int i=1;i<=n;i++) {
string s;
cin>>s;
if(mp[s]) mp[s]--;
else ans++;
}
cout<<ans<<endl;
}
| codeforces | 37 | 441 |
127455241 | 1000A | -1 | cpp | Accepted | 30 | 3,743,744 | #include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<map>
using namespace std;
map<string, int>temp;
int main()
{
int n;
cin >> n;
int ans = n;
string s;
for (int i = 0; i < n; i++)
{
cin >> s;
temp[s]++;
}
for (int i = 0; i < n; i++)
{
cin >> s;
if (temp[s]-- > 0) ans--;
}
cout << ans;
return 0;
}
| codeforces | 37 | 441 |
39710108 | 1000A | -1 | cpp | Accepted | 31 | 8,192 | #include<bits/stdc++.h>
using namespace std;
int main()
{
unordered_map<string,int>mp;
string a,b;
int n,cnt=0;
cin>>n;
cin.ignore();
for(int i=1;i<=n;i++)
{
cin>>a;
mp[a]++;
}
for(int i=1;i<=n;i++)
{
cin>>b;
if(mp[b]==0)
cnt++;
else
mp[b]--;
}
cout<<cnt<<endl;
}
/*
L S M
XXS XXL
XS XL
XXXS XXXL
*/
| codeforces | 37 | 442 |
39718591 | 1000A | -1 | cpp | Accepted | 30 | 28,672 | #include<bits/stdc++.h>
using namespace std;
string a[105],b[105];
int main()
{
int ans=0;
int n; cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
cin>>b[i];
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++){
if(a[i]==b[j]) {ans++;b[j]='-1'; break;}
}
}
if(ans==n) return cout<<0,0;
cout<<abs(ans-n)<<endl;
return 0;
}
| codeforces | 37 | 442 |
39725243 | 1000A | -1 | cpp | Accepted | 31 | 12,288 | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, t;
map<string, int> mp;
cin>>n;
int count=0;
string str;
for(int i=0;i<n;i++)
{
cin>>str;
mp[str]++;
}
for(int i=0;i<n;i++){
cin>>str;
if(mp[str]!=0) {
mp[str]--;
}
else count++;
}
cout<<count;
}
| codeforces | 37 | 442 |
39746974 | 1000A | -1 | cpp | Accepted | 31 | 151,552 | #include<bits/stdc++.h>
#define REP(i,n) for ( int i = 0 ; i < n ; i ++ )
#define RREP(i,n) for ( int i = n - 1 ; i > 0 ; i -- )
using namespace std;
int main(){
multiset<string> m ;
string s ;
int n ;
cin >> n ;
REP ( i , n ) {
cin >> s ;
m.insert ( s ) ;
}
int ans = 0 ;
REP ( i , n ) {
cin >> s ;
if ( m.count ( s ) ) m.erase ( m.find ( s ) ) ;
else ans ++ ;
}
cout << ans << endl ;
//main();
} | codeforces | 37 | 442 |
39786595 | 1000A | -1 | cpp | Accepted | 31 | 4,096 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,x,n) for(long i=long(x);i<long(n);i++)
#define M 1000000007
int main()
{
ios::sync_with_stdio(0);cin.tie(0);
map<string,long> m;
long n,p=0;
string s;
cin>>n;
rep(i,0,n)
{
cin>>s;
m[s]++;
}
rep(i,0,n)
{
cin>>s;
m[s]--;
}
for(auto i:m)
p+=abs(i.second);
cout<<p/2;
} | codeforces | 37 | 442 |
39973344 | 1000A | -1 | cpp | Accepted | 31 | 20,480 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
using namespace std;
map <string, int> mp;
int main(void) {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
string s;
cin >> s;
++mp[s];
}
int ans = 0;
for (int i = 0; i < n; i++) {
string t;
cin >> t;
if (mp[t]) --mp[t];
else ++ans;
}
printf("%d\n", ans);
return 0;
}
| codeforces | 37 | 442 |
40193303 | 1000A | -1 | cpp | Accepted | 30 | 303,104 | #include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
using namespace std;
map<string,int> mp;
int main()
{
int n,cnt = 0;
string str;
cin >> n;
for(int i=0;i<n;i++)
{
cin >> str;
mp[str]++;
}
for(int i=0;i<n;i++)
{
cin >> str;
if(mp[str] == 0) cnt++;
else mp[str]--;
}
cout << cnt << endl;
return 0;
}
| codeforces | 37 | 442 |
40689423 | 1000A | -1 | cpp | Accepted | 31 | 147,456 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
#define inf 0x3f3f3f3f
#define eps 1e-6
#define dbg(x) cout<<#x<<"="<<(x)<<endl
map<string ,int>a,b;
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
string s;
cin>>s;
a[s]++;
}
int ans=n;
for(int i=0;i<n;i++)
{
string s;
cin>>s;
b[s]++;
if(b[s]<=a[s])
ans--;
}
cout<<ans;
return 0;
}
| codeforces | 37 | 442 |
101493731 | 1000A | -1 | cpp | Accepted | 31 | 16,384 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100;
int n, res;
string last[maxn];
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> last[i];
}
for (int i = 0; i < n; i++)
{
string s;
cin >> s;
bool was = false;
for (int j = 0; j < n; j++)
{
if (last[j] == s)
{
was = true;
last[j] = "";
break;
}
}
if (!was)
res++;
}
cout << res;
}
| codeforces | 37 | 442 |
101493731 | 1000A | -1 | cpp | Accepted | 31 | 16,384 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100;
int n, res;
string last[maxn];
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> last[i];
}
for (int i = 0; i < n; i++)
{
string s;
cin >> s;
bool was = false;
for (int j = 0; j < n; j++)
{
if (last[j] == s)
{
was = true;
last[j] = "";
break;
}
}
if (!was)
res++;
}
cout << res;
}
| codeforces | 37 | 442 |
39706382 | 1000A | -1 | cpp | Accepted | 30 | 421,888 | #include <bits/stdc++.h>
using namespace std;
vector <string> a,b;
int p[100005];
int main()
{
int n,i,j,k,cnt=0;
string s;
cin >> n;
for(i=0;i<n;i++)
{
cin >> s;
a.push_back(s);
}
for(i=0;i<n;i++)
{
cin >> s;
b.push_back(s);
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(a[i]==b[j] && p[j]!=1)
{
p[j]=1;
break;
}
}
if(j==n)
cnt++;
}
cout << cnt;
return 0;
} | codeforces | 37 | 443 |
39805059 | 1000A | -1 | cpp | Accepted | 31 | 20,480 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int count=0;
string a[101];
string b[101];
cin >> n;
map<string,int> c;
for(int i=0;i<n;i++)
{
cin >> a[i];
c[a[i]]++;
}
for(int i=0;i<n;i++)
{
cin >> b[i];
if(c[b[i]]==0)
count++;
else
{
c[b[i]]--;
}
}
cout << count << endl;
return 0;
} | codeforces | 37 | 443 |
39805059 | 1000A | -1 | cpp | Accepted | 31 | 20,480 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int count=0;
string a[101];
string b[101];
cin >> n;
map<string,int> c;
for(int i=0;i<n;i++)
{
cin >> a[i];
c[a[i]]++;
}
for(int i=0;i<n;i++)
{
cin >> b[i];
if(c[b[i]]==0)
count++;
else
{
c[b[i]]--;
}
}
cout << count << endl;
return 0;
} | codeforces | 37 | 443 |
45383437 | 1000A | -1 | cpp | Accepted | 31 | 147,456 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
map<string, int> old, new_;
int main(){
int n;
string s;
cin >> n;
for(int i = 0; i < n; ++i){
cin >> s;
old[s]++;
}
int ans = 0;
for(int i = 0; i < n; ++i){
cin >> s;
new_[s]++;
}
for(auto & x : new_){
ans += max(0, (x.second - old[x.first]));
}
cout << ans;
} | codeforces | 37 | 443 |
79701865 | 1000A | -1 | cpp | Accepted | 31 | 3,731,456 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios::sync_with_stdio(0); cin.tie(0);
ll n; cin>>n;
map<string,ll>m,m2;
for(ll i=0;i<n;i++){
string t;
cin>>t;
m[t]++;
}
ll ans=n;
for(ll i=0;i<n;i++){
string t;
cin>>t;
if(m.count(t) and m[t]>0){
ans--;
m[t]--;
}
}
cout<<ans;
} | codeforces | 37 | 443 |
109124665 | 1000A | -1 | cpp | Accepted | 31 | 8,192 | #include<iostream>
#include<stack>
#include<map>
#include<string>
using namespace std;
typedef long long ll;
const int Max = 1e6 + 5;
int main()
{
map<string, int> ma;
int n;cin >> n;
for (int i = 1;i <= n;i++)
{
string str;cin >> str;
ma[str]++;
}
int sum = 0;
for (int i = 1;i <= n;i++)
{
string str;cin >> str;
if (ma[str] > 0)
{
ma[str]--;
}
else sum ++ ;
}
cout << sum << endl;
}
| codeforces | 37 | 443 |
41002633 | 1000A | -1 | cpp | Accepted | 15 | 143,360 | #include <bits/stdc++.h>
using namespace std;
map <string, int> m;
map <string, int> p;
int main () {
int n, t = 0;
string s;
cin >> n;
for (int i = 0; i < n; i++) cin >> s, m[s]++;
for (int i = 0; i < n; i++) cin >> s, p[s]++;
t += abs (m["XXXS"] - p["XXXS"]);
t += abs (m["XXS"] - p["XXS"]);
t += abs (m["XS"] - p["XS"]);
t += max (max (abs (m["S"] - p["S"]), abs (m["L"] - p["L"])), abs (m["M"] - p["M"]));
cout << t << '\n';
}
| codeforces | 37 | 444 |
39704251 | 1000A | -1 | cpp | Accepted | 31 | 12,288 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
int n;
map<string, int> has;
int main() {
cin >> n;
rep(i, 0, n) {
string s;
cin >> s;
has[s]++;
}
int ans = 0;
rep(i, 0, n) {
string s;
cin >> s;
if (has[s] > 0) {
has[s]--;
} else {
ans++;
}
}
cout << ans;
return 0;
}
| codeforces | 37 | 444 |
39762924 | 1000A | -1 | cpp | Accepted | 31 | 3,559,424 | #include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
#include<iostream>
#include<map>
using namespace std;
const int maxn=100+7;
int n,ans;string a[maxn],b[maxn];
map<string,int>m;
int main(){
ios::sync_with_stdio(false);cin>>n;for(register int i=1;i<=n;++i)cin>>a[i],m[a[i]]++;
for(register int i=1;i<=n;++i){cin>>b[i];if(m[b[i]])--m[b[i]];else ++ans;}
cout<<ans<<endl;
return 0;
}
| codeforces | 37 | 444 |
41002633 | 1000A | -1 | cpp | Accepted | 15 | 143,360 | #include <bits/stdc++.h>
using namespace std;
map <string, int> m;
map <string, int> p;
int main () {
int n, t = 0;
string s;
cin >> n;
for (int i = 0; i < n; i++) cin >> s, m[s]++;
for (int i = 0; i < n; i++) cin >> s, p[s]++;
t += abs (m["XXXS"] - p["XXXS"]);
t += abs (m["XXS"] - p["XXS"]);
t += abs (m["XS"] - p["XS"]);
t += max (max (abs (m["S"] - p["S"]), abs (m["L"] - p["L"])), abs (m["M"] - p["M"]));
cout << t << '\n';
}
| codeforces | 37 | 444 |
42237445 | 1000A | -1 | cpp | Accepted | 31 | 4,096 | #include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <map>
using namespace std;
map<string,int> Hash;
int N;
int main(){
ios::sync_with_stdio(false);
cin>>N;
for(register int i=1;i<=N;++i){
string s;cin>>s;++Hash[s];
}
int Ans=0;
for(register int i=1;i<=N;++i){
string s;cin>>s;
if(Hash[s]) --Hash[s];
else ++Ans;
}
cout<<Ans<<endl;
return 0;
}
| codeforces | 37 | 444 |
70462125 | 1000A | -1 | cpp | Accepted | 31 | 8,192 | #include <algorithm>
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main() {
int n; cin >> n;
map<string, int> cnt;
for (int i = 0; i < n; i++) {
string s; cin >> s;
cnt[s]++;
}
int ans = 0;
for (int i = 0; i < n; i++) {
string s; cin >> s;
if (cnt[s] > 0) cnt[s]--;
else ans++;
}
cout << ans << endl;
return 0;
}
| codeforces | 37 | 444 |
41231195 | 1000A | -1 | cpp | Accepted | 31 | 20,480 | #include<stdio.h>
#include<stdio.h>
#include<map>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int t;
cin>>t;
string a[110];
string b[110];
map<string,int>mp;
for(int i=0;i<t;i++)
{
cin>>a[i];
mp[a[i]]++;
}
int w=0;
for(int i=0;i<t;i++)
{
cin>>b[i];
if(mp[b[i]])
{
mp[b[i]]--;
}
else
{
w++;
}
}
cout<<w<<endl;
return 0;
}
| codeforces | 37 | 445 |
39705524 | 1000A | -1 | cpp | Accepted | 30 | 147,456 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define se second
#define fi first
#define pb push_back
int main(){
// freopen("in.txt","r",stdin);
int n;
multiset<string> a;
scanf("%d",&n);
string s;
for(int i=0;i < n;i++){
cin >> s;
a.insert(s);
}
for(int i=0;i < n;i++){
cin >> s;
if(a.find(s) != a.end()) a.erase(a.lower_bound(s));
}
cout << a.size() << endl;
return 0;
}
| codeforces | 37 | 445 |
39705524 | 1000A | -1 | cpp | Accepted | 30 | 147,456 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define se second
#define fi first
#define pb push_back
int main(){
// freopen("in.txt","r",stdin);
int n;
multiset<string> a;
scanf("%d",&n);
string s;
for(int i=0;i < n;i++){
cin >> s;
a.insert(s);
}
for(int i=0;i < n;i++){
cin >> s;
if(a.find(s) != a.end()) a.erase(a.lower_bound(s));
}
cout << a.size() << endl;
return 0;
}
| codeforces | 37 | 445 |
39705729 | 1000A | -1 | cpp | Accepted | 31 | 12,288 | #include<bits/stdc++.h>
using namespace std;
map<string,int> dp[55];
static int dp1[55];
int main() {
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
string s;
cin>>s;
int len = s.length();
dp[len][s]++;
dp1[len]++;
}
int ans = 0;
for(int i=0;i<n;i++){
string s;
cin>>s;
int len = s.length();
if(dp[len][s] > 0) {
dp[len][s]--;
} else {
ans++;
}
}
printf("%d\n", ans);
return 0;
} | codeforces | 37 | 445 |
39731520 | 1000A | -1 | cpp | Accepted | 31 | 24,576 | #include <bits/stdc++.h>
using namespace std;
int main() {
//freopen("input", "r", stdin);
//freopen("output", "w", stdout);
map<string, int> a, b;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
a[s]++;
}
for (int i = 0; i < n; i++) {
string s;
cin >> s;
b[s]++;
}
int sum = 0;
for (auto x : a) {
if (x.second > b[x.first])
sum += abs(x.second - b[x.first]);
}
cout << sum << "\n";
return 0;
} | codeforces | 37 | 445 |
39739156 | 1000A | -1 | cpp | Accepted | 30 | 12,288 | #include <bits/stdc++.h>
#define ll long long int
#define loop(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
int main(){
fastio
int n,m;
cin>>n;
map<string,int> a;
multiset<string> b;
loop(i,n)
{
string t;
cin>>t;
a[t]++;
}
int count=0;
loop(i,n)
{
string t;
cin>>t;
if(a[t]>0)
a[t]--;
else
count++;
}
cout<<count;
} | codeforces | 37 | 445 |
39789116 | 1000A | -1 | cpp | Accepted | 31 | 151,552 | #include<bits/stdc++.h>
using namespace std;
map<string,int> mpa,mpb;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int n,ans=0;
cin >> n;
for(int i=0;i<n;i++) {
string s;cin>>s;mpa[s]++;
}
for(int i=0;i<n;i++) {
string s;cin>>s;mpb[s]++;
}
for(auto it:mpa){
ans+=min(it.second,mpb[it.first]);
}
cout << n-ans;
return 0;
} | codeforces | 37 | 445 |
39819040 | 1000A | -1 | cpp | Accepted | 46 | 4,096 | #include <iostream>
#include <map>
#include <set>
#include <string>
using namespace std;
map <string,int> mp;
set<string> st;
int main(int argc, char *argv[])
{
int n;
string s;
int ans=0;
cin>>n;
for(int i=1;i<=n;i++) cin>>s,mp[s]++,st.insert(s);
for(int i=1;i<=n;i++) cin>>s,mp[s]--;
set<string>::iterator it;
for(it=st.begin();it!=st.end();it++)
{
if(mp[*it]>0) ans+=mp[*it];
}
cout<<ans<<endl;
return 0;
} | codeforces | 37 | 445 |
40662855 | 1000A | -1 | cpp | Accepted | 31 | 12,288 | #include<iostream>
#include<map>
#include<cstdio>
using namespace std;
int n,ans;
char a[111][10],b[111][10];
map<string,int>A,B;
int main(){
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
cin>>b[i];
for(int i=0;i<n;i++)
A[a[i]]++;
for(int i=0;i<n;i++){
if(!A[b[i]])ans++;
else B[b[i]]++;
}
for(int i=0;i<n;i++)
if(B[a[i]]-A[a[i]]>0){
ans+=B[a[i]]-A[a[i]];
B[a[i]]=-1;
}
printf("%d\n",ans);
}
| codeforces | 37 | 445 |
41231195 | 1000A | -1 | cpp | Accepted | 31 | 20,480 | #include<stdio.h>
#include<stdio.h>
#include<map>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int t;
cin>>t;
string a[110];
string b[110];
map<string,int>mp;
for(int i=0;i<t;i++)
{
cin>>a[i];
mp[a[i]]++;
}
int w=0;
for(int i=0;i<t;i++)
{
cin>>b[i];
if(mp[b[i]])
{
mp[b[i]]--;
}
else
{
w++;
}
}
cout<<w<<endl;
return 0;
}
| codeforces | 37 | 445 |
41653389 | 1000A | -1 | cpp | Accepted | 31 | 8,192 | #include<bits/stdc++.h>
using namespace std;
int vis[1005];
int gets(string s){
int ret=0;
int slen=s.length();
for(int i=0;i<slen;i++){
ret+=(int)s[i];
}
return ret;
}
int main(){
int n;
scanf("%d",&n);
string s;
for(int i=0;i<n;i++){
cin>>s;
vis[gets(s)]++;
}
for(int i=0;i<n;i++){
cin>>s;
vis[gets(s)]--;
}
int ans=0;
for(int i=0;i<1000;i++){
ans+=max(0,vis[i]);
}
printf("%d\n",ans);
} | codeforces | 37 | 445 |
63526663 | 1000A | -1 | cpp | Accepted | 30 | 8,192 | #include<iostream>
#include<stdio.h>
#include<string.h>
#include<map>
using namespace std;
map<string,int>mapp;
int main(){
int n;
string s;
scanf("%d",&n);
for(int i=0;i<n;i++){
cin>>s;
mapp[s]++;
}
int ans=0;
for(int i=0;i<n;i++){
cin>>s;
if(mapp[s]){
mapp[s]--;
}
else ans++;
}
printf("%d\n",ans);
return 0;
}
| codeforces | 37 | 445 |
72568524 | 1000A | -1 | cpp | Accepted | 31 | 24,576 | #include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int N,count=0;
string s[500], t[500];
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> s[i];
}
for (int i = 0; i < N; i++)
{
cin >> t[i];
}
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
if (t[i] == s[j])
{
s[j] = '0';
count++;
break;
}
}
cout << N - count;
return 0;
}
| codeforces | 37 | 445 |
77284041 | 1000A | -1 | cpp | Accepted | 31 | 8,192 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout.precision(16);
int main()
{
int ans = 0, n;
string s;
map<string , int> cnt;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> s;
cnt[s]++;
}
for(int i = 0; i < n; i++)
{
cin >> s;
if(cnt[s])
cnt[s]--;
else
ans++;
}
cout << ans;
return 0;
}
| codeforces | 37 | 445 |
111993979 | 1000A | -1 | cpp | Accepted | 31 | 151,552 | #include<bits/stdc++.h>
using namespace std;
#define f(i,c,d) for(int i=c;i<d;i++)
const int inf=0x3f3f3f3f;
const int N=5e2+5;
map<string,int> a,b;
set<string> c;
int main(){
int n;
string m;
cin>>n;
f(i,0,n){
cin>>m;
a[m]++;
c.insert(m);
}
f(i,0,n){
cin>>m;
b[m]++;
}
int sum=0;
set<string>::iterator it;
for(it=c.begin();it!=c.end();it++){
sum+=max(0,a[*it]-b[*it]);
}
cout<<sum<<endl;
}
| codeforces | 37 | 445 |
112367721 | 1000A | -1 | cpp | Accepted | 31 | 57,344 | #include<bits/stdc++.h>
#define int long long
#define rep(i,t) for(int i=0;i<t;i++)
using namespace std;
const int maxn = 1e3+5;
int t,flag,ans=0;
string now[maxn],pre[maxn];
signed main()
{
ios::sync_with_stdio(false);cin.tie(0);
cin >> t;
rep(i,t) cin >> pre[i];
rep(i,t) cin >> now[i];
rep(i,t)
{
flag=1;
rep(j,t)
if(now[i]==pre[j]) {flag=0,pre[j]="x";break;}
if(flag) ans++;
}
cout << ans;
}
| codeforces | 37 | 445 |
40377726 | 1000A | -1 | cpp | Accepted | 31 | 8,192 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
map<string,int> a;
int a1[12]={};
int a2[12]={};
a["S"]=0;a["M"]=1;a["L"]=2;a["XS"]=3;a["XM"]=4;a["XL"]=5;a["XXS"]=6;a["XXM"]=7;a["XXL"]=8;a["XXXS"]=9;a["XXXM"]=10;a["XXXL"]=11;
for(int i=0;i<n;i++) {
string t;cin>>t;a1[a[t]]++;
}
for(int i=0;i<n;i++) {
string t;cin>>t;a2[a[t]]++;
}
int cnt=0;
for(int i=0;i<12;i++)
cnt+=max(a1[i]-a2[i],0);
cout<<cnt;
} | codeforces | 37 | 446 |
40407958 | 1000A | -1 | cpp | Accepted | 31 | 28,672 | #include <bits/stdc++.h>
using namespace std;
int n;
string s[3][111];
int res;
int main() {
ios_base :: sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= 2; i++) {
for (int j = 1; j <= n; j++) {
cin >> s[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (s[1][i] == s[2][j]) {
s[2][j] = "#";
res++;
break;
}
}
}
cout << n - res << endl;
return 0;
}
| codeforces | 37 | 446 |