#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
vector <vector<ll>> arr;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,k,c;
cin >> n >> k >> c;
arr.resize(n,vector<ll>(k));
for (int z=0;z<n;z++){
for (int x=0;x<k;x++){
cin >> arr[z][x];
}
}
if (k == 1){
ll ans = 0;
vector <ll> lol;
for (int z=0;z<n;z++){
ll temp = 0;
for (int x=0;x<k;x++){
temp += arr[z][x];
}
lol.push_back(temp);
}
sort(lol.rbegin(),lol.rend());
cout << lol[c-1] << endl;
} else if (k == 2){
vector <ll> lol;
for (int z=0;z<n;z++){
vector <ll> temp(k);
for (int x=0;x<k;x++){
temp[x] = arr[z][x];
}
for (int q=z+1;q<n;q++){
ll c = 0;
for (int x=0;x<k;x++){
temp[x] = max(temp[x],arr[q][x]);
c += temp[x];
}
lol.push_back(c);
}
}
sort(lol.rbegin(),lol.rend());
cout << lol[c-1] << endl;
} else {
}
}
Compilation message
olympiads.cpp: In function 'int main()':
olympiads.cpp:30:6: warning: unused variable 'ans' [-Wunused-variable]
ll ans = 0;
^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
7 ms |
1524 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
7 ms |
1524 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
