Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include <cstring>
- using namespace std;
- typedef struct Voz{
- char rel[50];
- float brKm;
- int brPatnici;
- }voz;
- typedef struct ZeleznickaStanica{
- char grad[20];
- voz niza[20];
- int brV;
- }ZeleznickaStanica;
- void najkratkaRelacija(ZeleznickaStanica* zs, int n, char* grad){
- int min=999999,min_indexI,min_indexJ,tmp;
- for(int i=0;i<n;i++){
- for(int j=0;j<zs[i].brV;j++){
- if(strcmp(zs[i].grad, grad)==0){
- if(zs[i].niza[j].brKm<min){
- min=zs[i].niza[j].brKm;
- min_indexI=i;
- min_indexJ=j;
- }
- if(zs[i].niza[j].brKm==min){
- min=zs[i].niza[j].brKm;
- min_indexI=i;
- min_indexJ=j;
- }
- }
- }
- }
- cout<<"Najkratka relacija: "<<zs[min_indexI].niza[min_indexJ].rel<<"("<<min<<" km)"<<endl;
- }
- int main(){
- int n;
- cin>>n; //se cita brojot na zelezlnichki stanici
- ZeleznickaStanica zStanica[100];
- for (int i=0;i<n;i++){
- //se citaat infomracii za n zelezlnichkite stanici i se zacuvuvaat vo poleto zStanica
- cin>>zStanica[i].grad;
- cin>>zStanica[i].brV;
- for(int j=0;j<zStanica[i].brV;i++){
- cin>>zStanica[i].niza[j].rel;
- cin>>zStanica[i].niza[j].brKm;
- cin>>zStanica[i].niza[j].brPatnici;
- }
- }
- char grad[25];
- cin>>grad;
- najkratkaRelacija(zStanica,n,grad);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement