fork download
  1. #include<iostream>
  2. #include<algorithm>
  3.  
  4. #define iofile(name) if(fopen(name".inp","r")) {freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
  5. #define ioquick ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  6. #define MAX int(105)
  7.  
  8. using namespace std;
  9.  
  10. int n, x, y, p[MAX], sl = 1;
  11. pair<int, int> a[MAX];
  12. string s[MAX];
  13.  
  14. int main()
  15. {
  16. #define name "diemso"
  17. if(fopen(name".inp","r"))
  18. {
  19. freopen(name".inp", "r", stdin);
  20. freopen(name".out", "w", stdout);
  21. }
  22. ios_base::sync_with_stdio(0);
  23. cin.tie(0); cout.tie(0);
  24.  
  25. cin >> n;
  26. for(int i = 1; i <= n; i++)
  27. {
  28. cin >> s[i];
  29. cin >> x >> y;
  30. a[i].first = x + y;
  31. a[i].second = i;
  32. }
  33. sort(a + 1, a + n + 1, greater<pair<int, int>>());
  34. p[a[1].second] = 1;
  35. for(int i = 2; i <= n; i++)
  36. {
  37. if(a[i].first != a[i-1].first)
  38. {
  39. p[a[i].second] = p[a[i-1].second] + sl;
  40. sl = 1;
  41. }
  42. else
  43. {
  44. p[a[i].second] = p[a[i-1].second];
  45. sl++;
  46. }
  47. }
  48. for(int i = 1; i <= n; i++)
  49. {
  50. cout << s[i] << ' ' << p[i] << '\n';
  51. }
  52. }
  53.  
Success #stdin #stdout 0s 5292KB
stdin
6
NA 3 5
MT 6 7
TB 5 5
VH 8 8
YN 6 2
PQ 4 3
stdout
NA 4
MT 2
TB 3
VH 1
YN 4
PQ 6