# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
295854 | Hemimor | Poi (IOI09_poi) | C++14 | 444 ms | 24176 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
int n,m,k;
vvi a;
vi b,c;
int main(){
scanf("%d%d%d",&n,&m,&k);
k--;
a=vvi(n,vi(m));
b=vi(m);
c=vi(n);
for(int i=0;i<n;i++) for(int j=0;j<m;j++){
scanf("%d",&a[i][j]);
b[j]+=1-a[i][j];
}
vvi d(n,vi(3));
for(int i=0;i<n;i++){
int t=0;
for(int j=0;j<m;j++){
c[i]+=b[j]*a[i][j];
t+=a[i][j];
}
d[i][0]=c[i];
d[i][1]=t;
d[i][2]=-i;
}
sort(d.rbegin(),d.rend());
cout<<c[k]<<' ';
for(int i=0;i<n;i++) if(d[i][2]==-k) cout<<i+1<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |