【算法分析】 本题的贪心需要预处理下，定义结构体 PosPosPos 存当前位置和当前位置能隔开的对数，开 222 个结构体一维数组，row[i].numrow[i].numrow[i].num 记录如果在第 iii 行加通道,可以分割多少对调皮学生,col[j].numcol[j].numcol[j].num 记录如果在第 jjj 列加通道,可以分割多少对调皮学生。 然后用 sortsortsort 排序，隔开对数多的放在前面，在此前提下，位置小的排到前面（输出的结果也要排序）。 最后输出分割学生最多的前 kkk 行和前 lll 列。 【参考代码】 【时间复杂度】 O(nlog2n)O(nlog_2n)O(nlog2 n) 【预计得分】 100pts100pts100pts

#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl; }#include <iostream> #include <algorithm> using namespace std; struct edge{ int num; int sum; }; bool cmp1(edge a,edge b){ return a.sum > b.sum; } bool cmp2(edge a,edge b){ return a.num < b.num; } edge row[2001]; edge col[2001]; int main(){ int M,N,K,L,D; while(cin >> M ){ cin >> N >> K >> L >> D; int i; for(i = 0;i < M;i++){ row[i].num = i + 1; row[i].sum = 0; } for(i = 0;i < N;i++){ col[i].num = i + 1; col[i].sum = 0; } for(i = 0;i < D;i++){ int a,b,x,y; cin >> a >> b >> x >> y; if(a == x){ col[min(b,y) - 1].sum++;; } if(b == y){ row[min(a,x) - 1].sum++; } } sort(row,row+M,cmp1); sort(col,col+N,cmp1); sort(row,row+K,cmp2); sort(col,col+L,cmp2); for(i = 0;i < K;i++){ if(i != K - 1) cout << row[i].num << ' '; else cout << row[i].num; } cout << endl;