1 solutions
-
-2
C++ :
#include<bits/stdc++.h> using namespace std; int f,d,m,g,xx,a[1005],t,b[1005],c[1005],x,y,ans; int main() { cin>>f>>m>>g; for(int i=0;i<f;i++) for(int j=0;j<m;j++){ cin>>xx; a[t++]=xx; if(xx>g) b[i]++; if(xx<g) c[i]++;} sort(a,a+t); sort(b,b+f); sort(c,c+f); int mid=(t-1)/2; if(a[mid]==g) {cout<<0<<" "<<0;return 0;} if(a[mid]>g){ for(int i=mid;i>=0;i--) if(a[i]>g) ans++; else break; y=ans; for(int i=f-1;i>=0;i--){ x++; if(y-b[i]>0) y-=b[i]; else break;}} else{ for(int i=mid;i<t;i++) if(a[i]<g) ans++; else break; y=ans; for(int i=f-1;i>=0;i--){ x++; if(y-c[i]>0) y-=c[i]; else break;}} cout<<x<<" "<<ans; return 0; }
- 1
Information
- ID
- 640
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 10
- Tags
- # Submissions
- 6
- Accepted
- 3
- Uploaded By