#include <bits/stdc++.h>
using namespace std;
int const N=505;
vector<int> arr[N];
vector<int> answer;
int main(){
int n,k,c;
cin>>n>>k>>c;
for(int i=0;i<n;i++)
for(int j=0;j<k;j++){
int a;
cin>>a;
arr[i].push_back(a);
}
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++){
int sm=0;
for(int t=0;t<k;t++)
sm+=max(arr[i][t],arr[j][t]);
answer.push_back(sm);
}
sort(answer.begin(),answer.end());
reverse(answer.begin(),answer.end());
cout<<answer[c-1]<<endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
980 KB |
Output is correct |
2 |
Correct |
6 ms |
984 KB |
Output is correct |
3 |
Correct |
5 ms |
984 KB |
Output is correct |
4 |
Correct |
3 ms |
1092 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
984 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
980 KB |
Output is correct |
2 |
Correct |
6 ms |
984 KB |
Output is correct |
3 |
Correct |
5 ms |
984 KB |
Output is correct |
4 |
Correct |
3 ms |
1092 KB |
Output is correct |
5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |