Advertisement
MariusPure

sort by alphabet and ascending

Jun 7th, 2019
123
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.30 KB | None | 0 0
  1. #include "pch.h"
  2. #include <iostream>
  3. #include <fstream>
  4. #include <algorithm>
  5. #include <vector>
  6. #include <string>
  7. #include <iomanip>
  8. using namespace std;
  9.  
  10. struct autom
  11. {
  12. string model;
  13. int year = 0;
  14. int month = 0;
  15. int price = 0;
  16. int age = 0;
  17. };
  18. autom m[222];
  19.  
  20. int n = 0;
  21. void skaitymas(int &n, autom m[]);
  22. void rikiavimas(int n, autom m[]);
  23. void spausdinimas(int n, autom m[]);
  24.  
  25. int main()
  26. {
  27. skaitymas(n, m);
  28. rikiavimas(n, m);
  29. spausdinimas(n, m);
  30. }
  31.  
  32. void skaitymas(int &n, autom m[])
  33. {
  34. char x[25];
  35. ifstream d("duom.txt");
  36. d >> n;
  37. d.ignore();
  38.  
  39. for (int i = 0; i < n; i++)
  40. {
  41. d.get(x, 25);
  42. m[i].model = x;
  43. d >> m[i].year >> m[i].month >> m[i].price;
  44. d.ignore();
  45. m[i].age = (m[i].year * 12) + m[i].month;
  46. }
  47. d.ignore();
  48. d.close();
  49. }
  50. void rikiavimas(int n, autom m[])
  51. {
  52. for (int i = 0; i < n; i++)
  53. {
  54. for (int j = 0; j < n; j++)
  55. {
  56. if ((m[i].model < m[j].model) || ((m[i].model == m[j].model) && (m[i].age < m[j].age)))
  57. {
  58. swap(m[i].model, m[j].model);
  59. swap(m[i].age, m[i].age);
  60. swap(m[i].price, m[j].price);
  61. swap(m[i].age, m[j].age);
  62. }
  63. }
  64. }
  65.  
  66. }
  67.  
  68. void spausdinimas(int n, autom m[])
  69. {
  70. for (int i = 0; i < n; i++)
  71. {
  72. cout << m[i].model << m[i].age/12 << " " << m[i].age%12 << " " << m[i].price << endl;
  73. }
  74. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement