18
gorazd
c_cpp
8 months ago
1.4 kB
5
Indexable
1kolok_OOP
#include <iostream>
#include <cstring>
#include <iomanip>
using namespace std;
struct SkiLift {
char name[15];
int max;
bool func;
};
struct SkiCenter {
char name[20];
char country[20];
SkiLift lifts[20];
int numberOfLifts;
};
void print(SkiCenter &c, int max) {
cout<<c.name<<endl;
cout<<c.country<<endl;
cout<<max;
}
int getCapacity(SkiCenter s) {
int cap = 0;
for (int i = 0; i<s.numberOfLifts; i++) {
if (s.lifts[i].func==1)
cap+=s.lifts[i].max;
}
return cap;
}
void najgolemKapaciteet(SkiCenter *sc, int n) {
int maxCap = 0;
SkiCenter goat;
for (int i = 0; i<n; i++) {
if (getCapacity(sc[i])>maxCap) {
maxCap = getCapacity(sc[i]);
goat = sc[i];
}else if (getCapacity(sc[i])==maxCap) {
if (sc[i].numberOfLifts>goat.numberOfLifts) {
goat = sc[i];
maxCap = getCapacity(sc[i]);
}
}
}
print(goat,maxCap);
}
int main() {
int n;
cin>>n;
SkiCenter s[n];
for (int i = 0; i<n; i++) {
cin>>s[i].name;
cin>>s[i].country;
cin>>s[i].numberOfLifts;
for (int j = 0; j<s[i].numberOfLifts; j++) {
cin>>s[i].lifts[j].name;
cin>>s[i].lifts[j].max;
cin>>s[i].lifts[j].func;
}
}
najgolemKapaciteet(s,n);
}Editor is loading...
Leave a Comment