| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 166585 | 钟佳瑜 | 双关键字排序 | C++ | Runtime Error | 0 | 0 MS | 88 KB | 380 | 2024-08-19 14:55:46 |
#include <iostream> #include<algorithm> using namespace std; long p[10005][10005]; int main(){ int n; cin>>n; long a[n],b[n],am=0,bm=0; for(int i=0;i<n;i++){ cin>>a[i]>>b[i]; if(a[i]>am) am=a[i]; if(b[i]>bm) bm=b[i]; p[a[i]][b[i]]++; } for(int i=0;i<=am;i++){ for(int j=0;j<=bm;j++){ if(p[i][j]!=0) cout<<i<<" "<<j<<endl; } } return 0; }