#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int main()
{ int km[5], por, kolko, i, d, h, p1, p2;
for (i=0;i<5;i++) {
	km[i]=0;
}
ifstream subor ("Vodici.txt");
while (!subor.eof())
	{ subor >> por >>kolko;
	 km[por-1]+=kolko;
	}
d=min (km[0], km[4]);
h=max(km[0], km[4]);
for (i=0; i<5;i++) {
		if(km[i]==h) p2=i;
		if (km[i]==d) p1=i;
}
cout << "Najmenej najazdil vodic cislo " <<p1+1<< " a bolo to "<<d<< "km" <<endl;
cout << "Najviac najazdil vodic cislo "<<p2+1<< " a bolo to " <<h <<"km"<<endl;
return 0;
}