Saleh127

uva 11804

Jun 19th, 2020
160
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.04 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. struct inform
  4. {
  5. string name;
  6. int attack,defend;
  7.  
  8. } a[10];
  9.  
  10. bool cmprpwr(inform a,inform c)
  11. {
  12. if(a.attack > c.attack) return 1;
  13.  
  14. else if(a.attack < c.attack) return 0;
  15.  
  16. if(a.defend < c.defend) return 1;
  17.  
  18. else if(a.defend > c.defend) return 0;
  19.  
  20. if(a.name < c.name) return 1;
  21.  
  22. else return 0;
  23. }
  24.  
  25. bool namecmpr(inform a,inform c)
  26. {
  27. return a.name<c.name;
  28. }
  29.  
  30. int main()
  31. {
  32. int t,i,j,k,l;
  33. cin>>t;
  34. for(k=1;k<=t;k++)
  35. {
  36. for(i=0;i<10;i++)
  37. {
  38. cin>>a[i].name>>a[i].attack>>a[i].defend;
  39. }
  40. sort(a,a+10,cmprpwr);
  41. sort(a,a+5,namecmpr);
  42. sort(a+5,a+10,namecmpr);
  43. printf("Case %d:\n(",k);
  44. cout<<a[0].name;
  45. for(i=1;i<5;i++)
  46. {
  47. cout<<", "<<a[i].name;
  48. }
  49. printf(")\n(");
  50. cout<<a[5].name;
  51. for(i=6;i<10;i++)
  52. {
  53. cout<<", "<<a[i].name;
  54. }
  55. printf(")\n");
  56. }
  57. return 0;
  58. }
Advertisement
Add Comment
Please, Sign In to add comment