Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- #include <tr1/unordered_set> /// Includ libraria pentru SET-uri
- using namespace std;
- using namespace tr1; /// Includ namespace-ul pentru SET-uri
- ifstream in("masinute.in");
- ofstream out("masinute.out");
- unordered_set <int> h; /// Declar setul
- int main( )
- {
- int Q,dubluri=0,sol=0;
- in >> Q;
- for(int i=1; i<=Q; i++)
- {
- int x,y,maxim;
- in>>x>>y; /// Citesc perechea de numere
- maxim=max(x,y); /// Aflu cel mai mare numar dintre cele 2 (GREEDY)
- sol=(sol+maxim)%666013; /// Adaug maximul la solutie
- if(h.find(maxim)!=h.end()) /// Caut maximul in SET
- {
- dubluri++; /// Daca il gasesc, maresc numarul de dubluri
- }
- else
- h.insert(maxim); /// Daca nu, il adaug in set
- }
- out<<sol<<" "<<dubluri; /// Afisez solutia
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement