# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1163941 | jj_master | Art Exhibition (JOI18_art) | C++20 | 1093 ms | 8264 KiB |
// JOI 2018
#include <bits/stdc++.h>
#include <climits>
using namespace std;
#define int int64_t
struct art {
int si;
int val;
bool operator<(const art& other) const {
if(si == other.si)
return val > other.val;
return si < other.si;
}
};
void sol()
{
int n;
cin >> n;
vector<art> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i].si >> a[i].val;
}
sort(a.begin(), a.end());
int max_score = INT_MIN;
for(int i = 0; i < n; i++) {
int tot_val = 0;
int min_si = a[i].si;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |