Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- vector<int>v1;
- vector<int>v2;
- void ReadTransfInsert(int n){
- string s;
- cin>>s;
- int a;
- if (s[0]>='2' && s[0]<='9')
- a=(s[0]-'0')*10;
- else if (s[0]=='T')
- a=100;
- else if (s[0]=='J')
- a=110;
- else if (s[0]=='Q')
- a=120;
- else if (s[0]=='K')
- a=130;
- else if (s[0]=='A')
- a=140;
- int b;
- if (s[1]=='H')
- b=3;
- else if (s[1]=='S')
- b=2;
- else if (s[1]=='D')
- b=1;
- else
- b=0;
- if (n==1)
- v1.push_back(a+b);
- else
- v2.push_back(a+b);
- }
- int main() {
- int ncasos;
- cin>>ncasos;
- while(ncasos--){
- int ncards;
- cin>>ncards;
- for (int i=0;i<ncards;i++)
- ReadTransfInsert(1);
- for (int i=0;i<ncards;i++)
- ReadTransfInsert(2);
- sort(v1.begin(),v1.begin()+ncards);
- sort(v2.begin(),v2.begin()+ncards);
- vector<int>::iterator it1=v1.begin();
- vector<int>::iterator it2=v2.begin();
- int ans=0;
- while(it1!=v1.end() && it2!=v2.end()){
- if ((*it1)>=(*it2))
- it2++;
- else{
- ans++;
- it1++;it2++;
- }
- }
- cout<<ans<<endl;
- v1.clear();
- v2.clear();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment