Advertisement
Guest User

Untitled

a guest
Feb 18th, 2020
104
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.90 KB | None | 0 0
  1. #include <iostream>
  2. #include <cstring>
  3. using namespace std;
  4. struct concurent
  5. {
  6. char nume[30],prenume[30];
  7. int varsta;
  8. float inaltime, greutate;
  9. };
  10. void cit(int &n,concurent v[50])
  11. {
  12. int i;
  13. cout<<"n=";
  14. cin>>n;
  15. for(i=1; i<=n; i++)
  16. {
  17. cout<<"v["<<i<<"].nume=";
  18. cin>>v[i].nume;
  19. cout<<"v["<<i<<"].prenume=";
  20. cin>>v[i].prenume;
  21. cout<<"v["<<i<<"].varsta=";
  22. cin>>v[i].varsta;
  23. cout<<"v["<<i<<"].inaltime=";
  24. cin>>v[i].inaltime;
  25. cout<<"v["<<i<<"].greutate=";
  26. cin>>v[i].greutate;
  27. }
  28.  
  29. }
  30. void v2(int &n,concurent v[50],int &k,int &x,concurent w[50])
  31. {
  32. int i, j, ok, m;
  33. cout<<"x=";
  34. cin>>x;
  35. k=0;
  36. for(i=1; i<=n-1; i++)
  37. {
  38. ok=0;
  39. if(v[i].inaltime>x)
  40. for(j=i+1; j<=n; j++)
  41. if(strcmp(v[i].nume,v[j].nume)==0&&v[j].inaltime>x)
  42. {
  43. ok=1;
  44. k++;
  45. w[k]=v[j];
  46. for(m=j; m<=n-1; m++)
  47. v[m]=v[m+1];
  48. n--;
  49. j--;
  50. }
  51. if(ok==1)
  52. {
  53. k++;
  54. w[k]=v[i];
  55. }
  56. }
  57. }
  58. void sort(int k,concurent w[50])
  59. {
  60. int i, j;
  61. concurent aux;
  62. for(i=1; i<=k-1; i++)
  63. for(j=i+1; j<=k; j++)
  64. if(w[i].greutate<w[j].greutate)
  65. {
  66. aux=w[i];
  67. w[i]=w[j];
  68. w[j]=aux;
  69. }
  70. }
  71. void afis(int k,concurent w[50])
  72. {
  73. int i;
  74. for(i=1; i<=k; i++)
  75. {
  76. cout<<w[i].nume<<" "<<w[i].prenume<<" "<<w[i].varsta<<"ani"<<" "<<w[i].inaltime<<"cm"<<" "<<w[i].greutate<<"kg";
  77. cout<<endl;
  78. }
  79. }
  80. int main()
  81. {
  82. concurent v[50], w[50];
  83. int n,x,k;
  84. cit(n,v);
  85. v2(n,v,k,x,w);
  86. sort(k,w);
  87. afis(k,w);
  88. return 0;
  89. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement