oj.uz

답안 #720958

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
720958 2023-04-09T22:47:26 Z n0sk1ll Olympiads (BOI19_olympiads) C++14
13 / 100
 8 ms 984 KB 
#include <bits/stdc++.h>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;







//Note to self: Check for overflow

int broj[512][8];

int main()
{
    FAST;

    int n,k,c; cin>>n>>k>>c;
    ff(i,0,n) ff(j,0,k) cin>>broj[i][j];

    vector<int> sorta;
    ff(i,0,n) ff(j,i+1,n) sorta.pb(max(broj[i][0],broj[j][0])+max(broj[i][1],broj[j][1]));
    sort(all(sorta),greater<int>()); cout<<sorta[c-1]<<"\n";
}

//Note to self: Check for overflow

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 984 KB Output is correct
2 Correct 7 ms 964 KB Output is correct
3 Correct 6 ms 984 KB Output is correct
4 Correct 4 ms 984 KB Output is correct

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 984 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 984 KB Output is correct
2 Correct 7 ms 964 KB Output is correct
3 Correct 6 ms 984 KB Output is correct
4 Correct 4 ms 984 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -