Run ID Author Problem Lang Verdict Score Time Memory Code Length Submit Time
141340 方文轩 宝藏 C++ Time Limit Exceeded 0 2022 MS 260 KB 746 2024-04-03 14:02:02

Tests(0/10):


#include<bits/stdc++.h> using namespace std; struct st{ int x,y; }; int s; int a[100001]; st b[100005]; bool cmp(st m,st n){ if(m.y!=n.y){ return m.y>n.y; } return m.x>n.x; } int put(){ int s=a[1]; for(int i=1;i<=s;i++){ if(a[i]<=s){ s=a[i]; a[i]=0; } } int cnt=1; for(int i=2;i<=s;i++){ if(a[i]!=0){ a[cnt]=a[i]; cnt++; } } s=cnt-1; } int main(){ int m,n,p; cin>>m>>n>>p; for(int i=1;i<=p;i++){ cin>>b[i].x>>b[i].y; } sort(b+1,b+p+1,cmp); for(int i=1;i<=p;i++){ cout<<b[i].x<<" "<<b[i].y<<endl; } for(int i=1;i<=p;i++){ a[i]=b[i].x; } s=p; for(int i=1;i<=s;i++){ cin>>a[i]; } int sum=1; while(s!=0){ put(); sum++; } cout<<sum-1; }


Judgement Protocol: