# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1110253 | vjudge1 | Ski 2 (JOI24_ski2) | C++98 | 1 ms | 336 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;
int n;
pair<long long,long long> a[305];
int b[305];
long long k;
bool cmp(pair<long long,long long> a,pair<long long,long long>b)
{
if(a.first>b.first) return false;
if(a.first<b.first) return true;
return a.second>b.second;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for(int i=0;i<n;i++)
{
cin >> a[i].first >> a[i].second;
b[i]=1;
}
sort(a,a+n);
long long res=0;
for(int i=1;i<n;i++)
{
if(a[i].first==a[0].first)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |