Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <string.h>
- using namespace std;
- class PlDrustvo{
- private:
- char *ime=new char;
- int brc,brt;
- public:
- PlDrustvo(){}
- PlDrustvo(char *i,int brT,int brC)
- {
- // ime=new char[strlen(i)+1];
- strcpy(ime,i);
- brt=brT;
- brc=brC;
- }
- PlDrustvo(const PlDrustvo &pl)
- {
- ime=new char[strlen(pl.ime)+1];
- //cout<<"COPY"<<pl;
- strcpy(this->ime,pl.ime);
- //cout<<"COPY"<<ime<<" "<<pl.ime<<endl;
- this->brt=pl.brt;
- this->brc=pl.brc;
- }
- ~PlDrustvo()
- {
- // cout<<"POVIKAN DELETE ZA "<<this->ime<<endl;
- delete []ime;
- }
- friend bool operator>(PlDrustvo d1,PlDrustvo d2)
- {
- if(d1.brc>d2.brc)
- return true;
- return false;
- }
- friend bool operator<(PlDrustvo d1,PlDrustvo d2)
- {
- return d1.brc<d2.brc;
- }
- /* PlDrustvo operator+(PlDrustvo a, PlDrustvo b) {
- PlDrustvo p;
- return p;
- }*/
- friend PlDrustvo operator+(PlDrustvo pl,PlDrustvo pl1)
- {
- PlDrustvo p;
- if(pl>pl1)
- {
- p.brc=pl.brc+pl1.brc;
- p.ime=new char[strlen(pl.ime)+1];
- strcpy(p.ime,pl.ime);
- p.brt=pl.brt;
- // cout<<p.ime<<" tuj e copy povikan za p"<<endl;
- // cout<<"zavrshue +";
- return p;
- }
- else
- {
- p.brc=pl.brc+pl1.brc;
- p.ime=new char[strlen(pl1.ime)+1];
- strcpy(p.ime,pl1.ime);
- p.brt=pl1.brt;
- // cout<<p.ime<<" tuj e copy povikan za p"<<endl;
- // cout<<"zavrshue +";
- return p;
- }
- }
- PlDrustvo & operator=(PlDrustvo const &p)
- {
- this->brc=p.brc;
- this->brt=p.brt;
- delete []this->ime;
- this->ime=new char[strlen(p.ime)+1];
- strcpy(ime,p.ime);
- return *this;
- }
- friend ostream & operator <<(ostream &o,PlDrustvo p)
- {
- o<<"Ime: "<<p.ime<<" Turi: "<<p.brt<<" Clenovi: "<<p.brc<<endl;
- return o;
- }
- friend void najmnoguClenovi(PlDrustvo *p,int n)
- {
- int maxbrc=0;
- int red;
- for(int i=0;i<n;i++)
- {
- if(p[i].brc>maxbrc)
- {
- maxbrc=p[i].brc;
- red=i;
- }
- }
- cout<<"Najmnogu clenovi ima planinarskoto drustvo: "<<p[red];
- }
- };
- int main()
- {
- PlDrustvo drustva[3];
- PlDrustvo pl;
- for (int i=0;i<3;i++)
- {
- char ime[100];
- int brTuri;
- int brClenovi;
- cin>>ime;
- cin>>brTuri;
- cin>>brClenovi;
- PlDrustvo p(ime,brTuri,brClenovi);
- // cout<<p;
- drustva[i] = p;
- }
- pl = (drustva[0] + drustva[1]);
- cout<<pl;
- najmnoguClenovi(drustva, 3);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement