제출 #200046

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
200046		wilwxk	Lightning Rod (NOI18_lightningrod)	C++14	100 / 100	1719 ms	78424 KiB

Main

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e7+7;
pair<int, int> v[MAXN];
int n;

int getn() {
	char ch = getchar_unlocked();
    int ans = 0;
    while(!isdigit(ch)) {
        ch = getchar_unlocked();
    }
    while(isdigit(ch)) {
        ans = ans * 10 + ch - '0';
        ch = getchar_unlocked();
    }
    return ans;
}
 
int main() {
	n = getn();
	for(int i = 1; i <= n; i++) {
		int a = getn();
		int b = getn();
		v[i].first = a+b;
		v[i].second = b-a;
	}
	sort(v+1, v+1+n);
 
	int ans = 0; int mx = -(2e9+7);
	for(int i = n; i >= 1; i--) if(v[i].second > mx) mx = v[i].second, ans++;
 
	printf("%d\n", ans);
}

• Subtask 1: 4 / 4
• Subtask 2: 7 / 7
• Subtask 3: 12 / 12
• Subtask 4: 21 / 21
• Subtask 5: 26 / 26
• Subtask 6: 10 / 10
• Subtask 7: 20 / 20