[Offer收割]编程练习赛32 register

Ended

Participants:237

Verdict:Accepted
Score:100 / 100
Submitted:2017-10-22 12:19:06

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<algorithm>
#include<stack>
#include<cstring>
#include<vector>
#include<list>
#include<bitset>
#include<set>
#include<map>
#include<time.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn=1000+10;
const int inf=0x3f3f3f3f;
struct node{
    int pos;
    double x,y,r;
}nod[maxn];
int p[maxn];
bool cmp(node a,node b)
{
    return a.r>b.r;
}
int main()
{
    int n;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX