fork download
copy 
  1. #include <iostream>
  2. #include<bits/stdc++.h>
  3.  
  4. using namespace std;
  5.  
  6. int main() {
  7. 	// your code goes here
  8. 	int n;
  9. 	cin>>n;
  10. 	vector<int> m(n+1);
  11. 	vector<int> f(n+1);
  12. 	vector<int> p1;
  13. 	vector<int> p2;
  14. 	vector<int> p3;
  15. 	vector<int> p4;
  16.  
  17.  
  18.  
  19. 	for(int i=0;i<n;i++){
  20. 		cin>>m[i];
  21. 		if(m[i]>=0){
  22. 			p1.push_back(m[i]);
  23. 		}
  24. 		else{
  25. 			p2.push_back(-m[i]);
  26. 		}
  27. 	}
  28.  
  29. 	for(int i=0;i<n;i++){
  30. 		cin>>f[i];
  31. 		if(f[i]>=0){
  32. 			p3.push_back(f[i]);
  33. 		}
  34. 		else{
  35. 			p4.push_back(-f[i]);
  36. 		}
  37. 	} 
  38.  
  39. 	sort(p1.begin(),p1.end());
  40. 	sort(p2.begin(),p2.end());
  41. 	sort(p3.begin(),p3.end());
  42. 	sort(p4.begin(),p4.end());
  43.  
  44. 	int i=0;
  45. 	int j=0;
  46. 	int cnt=0;
  47.  
  48. 		while(i<p1.size() && j<p4.size()){
  49. 			if(p4[j]>p1[i]){
  50. 				cnt++;
  51. 				i++;
  52. 				j++;
  53.  
  54. 			}
  55. 			else if(p4[j]<=p1[i]){
  56. 				j++;
  57. 			}
  58. 		}
  59.  
  60. 		i = 0;
  61. 		j=0;
  62.  
  63. 		while(i<p2.size() && j<p3.size()){
  64. 			if(p2[i]>p3[j]){
  65. 				cnt++;
  66. 				i++;
  67. 				j++;
  68.  
  69. 			}
  70. 			else if(p2[i]<=p3[j]){
  71. 				i++;
  72. 			}
  73. 		}
  74.  
  75. 		cout<<cnt;
  76.  
  77.  
  78.  
  79.  
  80.  
  81. 	return 0;
  82. }
Success #stdin #stdout 0s 5324KB
comments (?)
stdin
copy 
2 
-1800 -2200
1800 1900
stdout
copy 
1
https://ideone.com/hP5IVE
language:
C++14 (gcc 8.3)
created:
7 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!