Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <cmath>
- using namespace std;
- int main(){
- int n;
- cin>>n;
- vector<int> k(4, 0);
- vector< vector<int> > v(4, vector<int>(2, 10000));
- for(int i=0;i<n;i++){
- int x, y;
- cin>>x>>y;
- if(x==0 || y==0){
- continue;
- }
- int c=-1;
- if(x>0){
- if(y>0){
- c=0;
- }
- else{
- c=3;
- }
- }
- else{
- if(y>0){
- c=1;
- }
- else{
- c=2;
- }
- }
- k[c]++;
- if(min(abs(v[c][0]),abs(v[c][1]))>min(abs(x),abs(y))){
- v[c][0]=x;
- v[c][1]=y;
- }
- }
- int K=-1;
- vector<int> ans;
- for(int i=0;i<4;i++){
- if(k[i]>K){
- K=k[i];
- ans.clear();
- ans.push_back(i);
- }
- else if(k[i]==K){
- ans.push_back(i);
- }
- }
- if(ans.size()==1){
- cout<<"K = "<<ans[0]+1<<'\n';
- cout<<"M = "<<k[ans[0]]<<'\n';
- cout<<"A = ("<<v[ans[0]][0]<<','<<v[ans[0]][1]<<")\n";
- cout<<"R = "<<min(abs(v[ans[0]][0]),abs(v[ans[0]][1]));
- }
- else{
- int R=0x7FFFFFFF;
- for(int i=0;i<ans.size();i++){
- R=min(R, min(abs(v[ans[i]][0]) , abs(v[ans[i]][1])) );
- }
- for(int i=0; i<ans.size();i++){
- if(min(abs(v[ans[i]][0]), abs(v[ans[i]][1]))==R){
- cout<<"K = "<<ans[i]+1<<'\n';
- cout<<"M = "<<k[ans[i]]<<'\n';
- cout<<"A = ("<<v[ans[i]][0]<<','<<v[ans[i]][1]<<")\n";
- cout<<"R = "<<min(v[ans[i]][0],v[ans[i]][1]);
- return 0;
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement