Advertisement
GerexD

greedy2

Feb 14th, 2019
120
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.94 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3.  
  4. using namespace std;
  5.  
  6. struct munka
  7. {
  8. int k,v,ssz;
  9. } a[30];
  10.  
  11. void beolvas(munka a[],int &n)
  12. {
  13. ifstream f("munka.be");
  14. f>>n;
  15. for(int i=1;i<=n;i++)
  16. {
  17. f>>a[i].k>>a[i].v;
  18. a[i].ssz=i;
  19. }
  20. }
  21.  
  22. void rendez(munka a[],int n)
  23. {
  24. int nn=n,jo;
  25. do
  26. {
  27. jo=1;
  28. for(int i=1;i<=nn-1;i++)
  29. if(a[i].v>a[i+1].v)
  30. {
  31. munka x=a[i]; a[i]=a[i+1]; a[i+1]=x; jo=0;
  32. }
  33. nn--;
  34. }while(jo==0);
  35. }
  36.  
  37. void moho(munka a[],int n)
  38. {
  39. cout<<"Elvegezheto munkak:"<<endl;
  40. cout<<a[1].k<<" "<<a[1].v<<" ("<<a[1].ssz<<")"<<endl;
  41. int x=a[1].v;
  42. for(int i=2;i<=n;i++)
  43. if(a[i].k>x)
  44. {
  45. cout<<a[i].k<<" "<<a[i].v<<" ("<<a[i].ssz<<")"<<endl;
  46. x=a[i].v;
  47. }
  48. }
  49.  
  50. int main()
  51. {
  52. int n;
  53. beolvas(a,n);
  54. rendez(a,n);
  55. moho(a,n);
  56. return 0;
  57. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement