Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- long long n, a[2000000], w, p=0, k=0, pa, ir, ap, ak;
- int main()
- {
- ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
- scanf("%d", &n);
- for(int f=0; f<n*2; f=f+2)
- {
- scanf("%d", &a[f]);
- scanf("%d", &a[f+1]);
- }
- sort(a, a+2*n);
- w=1;
- for(int y=0; y<2*n; y++)
- {
- if(a[y]==a[y+1])
- {
- w++;
- }
- else
- {
- ir++;
- if(w%2==0)
- {
- pa++;
- }
- if(w%2==0 && ap==0)
- {
- ap=a[y];
- }
- else if(w%2==0 && ak==0)
- {
- ak=a[y];
- }
- if(w%2!=0 && p==0)
- {
- p=a[y];
- }
- else if(w%2!=0 && k==0)
- {
- k=a[y];
- }
- w=1;
- }
- }
- if(p>0 && k>0)
- {
- printf("%d ", p);
- printf("%d ", k);
- }
- else if(pa==1 && p==0 && k==0)
- {
- printf("%d ", ap);
- printf("%d ", ap);
- }
- else if(pa==1 && p!=0 && k==0)
- {
- printf("%d ", min(p, ap));
- printf("%d ", max(p, ap));
- }
- else if(pa==1 && p==0 && k!=0)
- {
- printf("%d ", min(k, ap));
- printf("%d ", max(k, ap));
- }
- else
- {
- printf("NIE");
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement