-
Notifications
You must be signed in to change notification settings - Fork 0
/
CHEFNIL.cpp
93 lines (73 loc) · 1.68 KB
/
CHEFNIL.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
//10 Points
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N, M; vector< pair <int, int> > v;
cin>>N>>M;
int p1,q1;
int cnt=0;
int A[M][N][N];
int cn=0;
for(int i=0; i<M; i++)
{
for(int j = 0; j<N; j++)
{ for(int k =0; k<N; k++)
{
cin>>A[i][j][k];
}
}
}
int mn =A[0][0][0];
for(int i=0; i<M; i++)
{
for(int j = 0; j<N; j++)
{
for(int k =0; k<N; k++)
{
if(A[i][j][k] < mn)
mn=A[i][j][k];
}
}
}
for(int i=0; i<M; i++)
{ for(int j = 0; j<N; j++)
{ for(int k =0; k<N; k++)
{
if(A[i][j][k]>mn)
{
p1=j+1; q1=k+1;
v.push_back(make_pair(p1,q1)); ++cn;
}
}
}
}
sort(v.begin(), v.end());
vector< pair <int, int> > v1;
v1.push_back(make_pair(v[0].first,v[0].second));
++cnt;
for(int i = 1; i<cn; i++)
{
int j=i-1;
if(v[i].first != v[j].first || v[i].second != v[j].second)
{
v1.push_back(make_pair(v[i].first, v[i].second)); ++cnt;
}
}
if(cnt<M)
{
for(int i=cnt-1; i>=0; i--)
{
cout<<v1[i].first<<" "<<v1[i].second<<endl;
}
cout<<-1<<" "<<-1<<endl;
}
else
{
for(int i=cnt-1; i>=cnt-M; i--)
{
cout<<v1[i].first<<" "<<v1[i].second<<endl;
}
}
return 0;
}