Advertisement
keverman

Untitled

Nov 14th, 2020
32
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.92 KB | None | 0 0
  1.  
  2. #define _USE_MATH_DEFINES
  3. #include <iostream>
  4. #include <string>
  5. #include <cmath>
  6. #include <vector>
  7. #include <algorithm>
  8. #include <map>
  9.  
  10. int main()
  11. {
  12. int n, cnt = 0;
  13. scanf("%d", &n);
  14.  
  15. std::map<std::string, int> mp;
  16.  
  17. for (int i = 0; i < n; i++)
  18. {
  19. std::string name;
  20. std::cin >> name;
  21. mp[name] = cnt++;
  22. }
  23.  
  24. std::vector<std::string> results;
  25.  
  26. for (int i = 0; i < n; i++)
  27. {
  28. std::string name;
  29. std::cin >> name;
  30. results.push_back(name);
  31. }
  32.  
  33.  
  34. std::vector<std::pair<int, std::string>> rises;
  35.  
  36. for (int i = 0; i < results.size(); i++)
  37. if (i < mp[results[i]])
  38. rises.push_back(std::make_pair(mp[results[i]] - i, results[i]));
  39.  
  40. if(rises.empty())
  41. printf("suspicious\n");
  42.  
  43. else
  44. {
  45. std::sort(rises.begin(), rises.end(), [](std::pair<int, std::string>& l, std::pair<int, std::string>& r)
  46. {
  47. return l.first > r.first;
  48. });
  49. printf("%s\n", rises[0].second.c_str());
  50. }
  51. }
  52.  
  53.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement