1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; int f,m,g,xx,a[1005],t,da2,xiao2,change,x,b[1005],c[1005]; int main() { // freopen("692.in","r",stdin); // freopen("692.out","w",stdout); cin>>f>>m>>g; for(int i=0;i<f;i++) { int da=0,xiao=0; for(int j=0;j<m;j++) { cin>>xx; a[t++]=xx; if(xx>g) da++; if(xx<g) xiao++; } b[i]=da,c[i]=xiao; da2+=da,xiao2+=xiao; } sort(a,a+t);sort(b,b+f);sort(c,c+f); if(t%2==1){ if(a[t/2]==g) {cout<<0<<" "<<0;return 0;} if(a[t/2]>g){ for(int i=t/2;i>=0;i--) if(a[i]>g) change++; else break; } else{ for(int i=t/2;i<t;i++) if(a[i]<g) change++; else break; } } else{ if(a[t/2-1]==g) {cout<<0<<" "<<0;return 0;} if(a[t/2-1]>g){ for(int i=t/2-1;i>=0;i--) if(a[i]>g) change++; else break; } else{ for(int i=t/2-1;i<t;i++) if(a[i]<g) change++; else break; } } int change2=change; if(da2>xiao2){ for(int i=f-1;i>=0;i--) { x++; change2-=b[i]; if(change2<=0) break; } } else{ for(int i=f-1;i>=0;i--) { x++; change2-=c[i]; if(change2<=0) break; } } cout<<x<<" "<<change; return 0; }
- 1
Information
- ID
- 620
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By