/* Find howmany races your team can win with proper selection of your team player against opponent team Your team wins a race only if your team's player has a power more than your opponent's player power //First line contains number of players in a team say N. So there will be N races //Second line contains N power of each payer from your teams and all are seperated by space //Third line contains N power of each payer from opponent's team player and all are seperated by space //each power is in range of long long input : 10 3 6 7 5 3 5 6 2 9 1 2 7 0 9 3 6 0 6 2 6 output : 7 How: Your player : 3 9 1 * 5 7 2 * 3 * opponent player : 2 7 0 9 3 6 0 6 2 6 above 7 races you can win at max...Still you have left three players with power 6,5 and 6 which cannot win by any chance against your opponents having power 6,6 and 9 */ #include #include #include using namespace std; void method_Old(int N, vector& vecPower_T,vector& vecPower_O) { int cnt = 0; for(int race=0;race& vecPower_T,vector& vecPower_O) { int cnt = 0; int intT=0; int intO=0; for(int race=0;race vecPower_O[intO]) { ++cnt; ++intO; ++intT; } else { ++intO; } } cout << cnt << endl; } int main(int argc, char *a[]) { //Write code here int N; cin >> N; vector vecPower_T; vector vecPower_O; vecPower_T.reserve(N); vecPower_O.reserve(N); int i = 0; long long num; while(i>num; vecPower_T.emplace_back(num); ++i; } i = 0; while(i>num; vecPower_O.emplace_back(num); ++i; } sort(vecPower_T.begin(),vecPower_T.end()); sort(vecPower_O.begin(),vecPower_O.end()); method_Old(N,vecPower_T,vecPower_O); return 0; } int main_NeverUseRegex(int argc, char *a[]) { //Write code here int N; cin >> N; string strDummy,strPower_T,strPower_O; getline(cin,strDummy); getline(cin,strPower_T); getline(cin,strPower_O); regex reg("\\s+"); sregex_token_iterator start_T(strPower_T.begin(),strPower_T.end(),reg,-1); sregex_token_iterator end_T; sregex_token_iterator start_O(strPower_O.begin(),strPower_O.end(),reg,-1); sregex_token_iterator end_O; //cout << T << ";"<< N << ";"<< strPower_O << ";"<< strPower_O << endl; vector vecPower_T(N); vector vecPower_O(N); int i = 0; while(start_T!=end_T) { //cout << "*******" << stoll (*start_T,nullptr,10) << endl; vecPower_T[i] = stoll (*start_T,nullptr,10); vecPower_O[i] = stoll (*start_O,nullptr,10); ++start_T; ++start_O; ++i; } sort(vecPower_T.begin(),vecPower_T.end()); sort(vecPower_O.begin(),vecPower_O.end()); //method_Old(N,vecPower_T,vecPower_O); method_New(N,vecPower_T,vecPower_O); return 0; }

WorldCup