# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1088449 | vjudge1 | Izbori (COCI17_izbori) | C++17 | 1 ms | 460 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 <bits/stdc++.h>
using namespace std;
#define fastinput cin.tie(nullptr)->sync_with_stdio(false);
#define endl '\n'
#define ll long long
const ll mOd=1e9+7;
const int mAx=INT_MAX;
const int nUm=1e3+3;
int main()
{
fastinput;
ll n,m,k; cin>>n>>m>>k;
vector<pair<ll,ll>>p(m);
for(int i=0 ; i<m ; i++)p[i].first=0,p[i].second=i+1;
for(int i=0 ; i<n ; i++){
for(int j=0 ; j<m ; j++){
ll x; cin>>x; x--;
p[x].first+=j;
}
}
sort(p.begin(),p.end());
cout<<p[0].second<<endl;
for(int i=0 ; i<m ; i++){
if(p[i].second==k)
{
cout<<i<<endl;
break;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |