UVA_12210_A Match Making Problem

#include<iostream>#include<sstream>#include<string>#include<vector>#include<list>#include<set>#include<map>#include<stack>#include<queue>#include<algorithm>#pragma warning(disable:4996)#include<cstdio>#include<cstdlib>using std::cin;using std::cout;using std::endl;using std::stringstream;using std::string;using std::vector;using std::list;using std::pair;using std::set;using std::multiset;using std::map;using std::multimap;using std::stack;using std::queue;using std::priority_queue;int main(){//freopen("input.txt", "r", stdin);  //freopen("output.txt", "w", stdout);  int boy, girl,count=0;while (cin >> boy >> girl && (boy + girl)){vector<int>vec;for (int i = 0; i < boy; i++){int age; cin >> age;vec.push_back(age);}for (int i = 0; i < girl; i++){int age; cin >> age;}cout << "Case " << ++count << ": ";if (boy > girl){cout << boy - girl << ' '<<*std::min_element(vec.begin(), vec.end()) << endl;}else{cout << 0 << endl;}}return 0;}