fork download
  1. #include<stdio.h>
  2. #include<map>
  3. #include<string>
  4. #include<iostream>
  5. #include<vector>
  6. using namespace std;
  7. map<string, int>M;
  8. vector<string>P[121212];
  9. int main() {
  10. int n;
  11. scanf("%d", &n);
  12. for (int i = 0; i < n; i++) {
  13. string a; int b;
  14. cin >> a >> b;
  15. M[a] += b;
  16. }
  17. int m = 0, s = 0;
  18. for (auto q : M) P[q.second].push_back(q.first),s++;
  19. int cnt = 0;
  20. for (int i = 0; i < 121212; i++) {
  21. if (i == 0 && s < 7)cnt++;
  22. cnt+=!!P[i].size();
  23. if (cnt == 2) {
  24. if (P[i].size() > 1)printf("Tie");
  25. else printf("%s", P[i][0].c_str());
  26. return 0;
  27. }
  28. }
  29. if (cnt < 2)printf("Tie");
  30. return 0;
  31. }
Success #stdin #stdout 0s 6052KB
stdin
Standard input is empty
stdout
Tie